658 search results - page 54 / 132 » Open problems in the security of learning |
CTRSA
2011
Springer
13 years 1 months ago
2011
Springer
We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contribution...
ASIACRYPT
2011
Springer
12 years 10 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
JNCA
2007
13 years 10 months ago
2007
The goal of a DDoS (distributed denial of service) attack is to completely tie up certain resources so that legitimate users are not able to access a service. It has long been an ...
FOCS
2005
IEEE
14 years 3 months ago
2005
IEEE
We consider the problem of learning mixtures of product distributions over discrete domains in the distribution learning framework introduced by Kearns et al. [18]. We give a poly...
PODC
2003
ACM
14 years 3 months ago
2003
ACM
We propose a new cryptographic primitive called oblivious signaturebased envelope (OSBE). Informally, an OSBE scheme enables a sender to send an envelope (encrypted message) to a ...