Sciweavers

35 search results - page 1 / 7
» Trapdoors for Hard Lattices and New Cryptographic Constructi...
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
ECCC
2007
123views more  ECCC 2007»
13 years 4 months ago
Lossy Trapdoor Functions and Their Applications
We propose a general cryptographic primitive called lossy trapdoor functions (lossy TDFs), and use it to develop new approaches for constructing several important cryptographic to...
Chris Peikert, Brent Waters
STOC
2003
ACM
116views Algorithms» more  STOC 2003»
13 years 10 months ago
New lattice based cryptographic constructions
We introduce the use of Fourier analysis on lattices as an integral part of a lattice based construction. The tools we develop provide an elegant description of certain Gaussian d...
Oded Regev
IACR
2011
136views more  IACR 2011»
12 years 4 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
PKC
2010
Springer
177views Cryptology» more  PKC 2010»
13 years 8 months ago
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters, STOC ’08), and correlation-secure trapdoor functions (Rosen and Segev, TCC ’09). Ou...
David Mandell Freeman, Oded Goldreich, Eike Kiltz,...