Paper 2014/283
Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems
Nicolas Gama, Malika Izabachene, Phong Q. Nguyen, and Xiang Xie
Abstract
In lattice cryptography, worst-case to average-case reductions rely on two problems: Ajtai's SIS and Regev's LWE,
which both refer to a very small class of random lattices related to the group
Metadata
- Available format(s)
- Publication info
- A major revision of an IACR publication in EUROCRYPT 2016
- Keywords
- LatticesWorst-case to Average-case ReductionsHomomorphic EncryptionLWESISHidden Number Problem
- Contact author(s)
- Phong Nguyen @ inria fr
- History
- 2016-05-15: last of 2 revisions
- 2014-04-24: received
- See all versions
- Short URL
- https://ia.cr/2014/283
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/283, author = {Nicolas Gama and Malika Izabachene and Phong Q. Nguyen and Xiang Xie}, title = {Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/283}, year = {2014}, url = {https://eprint.iacr.org/2014/283} }