Trapdoors for hard lattices and new cryptographic constructions

Abstract

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 shortest nonzero vector to within certain polynomial factors). Our contributions include a new notion of trapdoor function with <i>preimage sampling</i>, simple and efficient "hash-and… (More)
DOI: 10.1145/1374376.1374407

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Statistics

0100200'05'06'07'08'09'10'11'12'13'14'15'16'17'18
Citations per Year

1,098 Citations

Semantic Scholar estimates that this publication has 1,098 citations based on the available data.

See our FAQ for additional information.