Sciweavers

94 search results - page 1 / 19
» New lattice based cryptographic constructions
Sort
View
STOC
2003
ACM
116views Algorithms» more  STOC 2003»
15 years 2 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
ECCC
2007
185views more  ECCC 2007»
14 years 9 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
PKC
2011
Springer
219views Cryptology» more  PKC 2011»
14 years 8 days ago
Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-Based Signatures
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
Dan Boneh, David Mandell Freeman
CRYPTO
2006
Springer
140views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Lattice-Based Cryptography
We describe some of the recent progress on lattice-based cryptography, starting from the seminal work of Ajtai, and ending with some recent constructions of very efficient cryptogr...
Oded Regev
STACS
2009
Springer
15 years 4 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert