35 search results - page 7 / 7 » Trapdoors for Hard Lattices and New Cryptographic Constructi... |
ACNS
2007
Springer
13 years 11 months ago
2007
Springer
Recently, there are several generic transformation techniques proposed for converting unforgeable signature schemes (the message in the forgery has not been signed yet) into strong...
SACRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. DES and triple-DES are two well-known and popular encryption algorithms, but they both have the same drawback: their block size is limited to 64 bits. While the cryptogra...
ASIACRYPT
2005
Springer
13 years 11 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
CANS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. Predicate encryption is a new powerful cryptographic primitive which allows for fine-grained access control for encrypted data: the owner of the secret key can release pa...
FOCS
1990
IEEE
13 years 9 months ago
1990
IEEE
Two of the most commonly used models in computational learning theory are the distribution-free model in which examples are chosen from a fixed but arbitrary distribution, and the ...