Sciweavers

49 search results - page 2 / 10
» A Feebly Secure Trapdoor Function
Sort
View
ECCC
2007
185views more  ECCC 2007»
13 years 4 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
SYNASC
2007
IEEE
142views Algorithms» more  SYNASC 2007»
13 years 11 months ago
An Extension of the RSA Trapdoor in a KEM/DEM Framework
A trapdoor based on an extension of the RSA trapdoor is proposed. The same function as in the RSA cryptosystem is used, i.e. x modn, but there is no restriction for the exponent t...
Bogdan Groza
CCS
2008
ACM
13 years 6 months ago
Robust, anonymous RFID authentication with constant key-lookup
A considerable number of anonymous RFID authentication schemes have been proposed. However, current proposals either do not provide robust security guarantees, or suffer from scal...
Mike Burmester, Breno de Medeiros, Rossana Motta
TCC
2009
Springer
142views Cryptology» more  TCC 2009»
14 years 5 months ago
Chosen-Ciphertext Security via Correlated Products
We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function f and a distribution on inputs ...
Alon Rosen, Gil Segev
EUROCRYPT
2010
Springer
13 years 9 months ago
Adaptive Trapdoor Functions and Chosen-Ciphertext Security
We introduce the notion of adaptive trapdoor functions (ATDFs); roughly, ATDFs remain one-way even when the adversary is given access to an inversion oracle. Our main application ...
Eike Kiltz, Payman Mohassel, Adam O'Neill