6 search results - page 1 / 2 » Fast Cryptographic Primitives and Circular-Secure Encryption... |
CRYPTO
2009
Springer
13 years 11 months ago
2009
Springer
The well-studied task of learning a linear function with errors is a seemingly hard problem and the basis for several cryptographic schemes. Here we demonstrate additional applicat...
TCC
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We propose a semantically-secure public-key encryption scheme whose security is polynomialtime equivalent to the hardness of solving random instances of the subset sum pr...
CRYPTO
2011
Springer
12 years 5 months ago
2011
Springer
We present a somewhat homomorphic encryption scheme that is both very simple to describe and analyze, and whose security (quantumly) reduces to the worst-case hardness of problems ...
PKC
2012
Springer
11 years 7 months ago
2012
Springer
We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (I...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We consider the problem of sending messages into the future." Previous constructions for this task were either based on heuristic assumptions or did not provide anon...