Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller

Abstract

We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), and asymptotically optimal with very small hidden constants. Our methods involve a new kind of trapdoor, and include specialized algorithms for inverting LWE, randomly sampling SIS preimages, and securely delegating trapdoors. These tasks were previously the main bottleneck for a wide range of cryptographic schemes, and our techniques substantially improve upon the prior ones, both in terms of practical performance and quality of the produced outputs. Moreover, the simple structure of the new trapdoor and associated algorithms can be exposed in applications, leading to further simplifications and efficiency improvements. We exemplify the applicability of our methods with new digital signature schemes and CCA-secure encryption schemes, which have better efficiency and security than the previously known lattice-based constructions.

DOI: 10.1007/978-3-642-29011-4_41
View Slides

Extracted Key Phrases

2 Figures and Tables

05010020102011201220132014201520162017
Citations per Year

346 Citations

Semantic Scholar estimates that this publication has 346 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Micciancio2011TrapdoorsFL, title={Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller}, author={Daniele Micciancio and Chris Peikert}, booktitle={IACR Cryptology ePrint Archive}, year={2011} }