Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Trapdoors for hard lattices and new cryptographic constructions

Trapdoors for hard lattices and new cryptographic constructions Trapdoors for Hard Lattices and New Cryptographic Constructions (Extended Abstract) Craig Gentry — Stanford University Chris Peikert cpeikert@alum.mit.edu 1. SRI International Vinod Vaikuntanathan ¡ vinodv@mit.edu MIT cgentry@cs.stanford.edu ABSTRACT INTRODUCTION 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 preimage sampling, simple and e ƒcient œhashand-sign  digital signature schemes, and identity-based encryption. A core technical component of our constructions is an ef cient algorithm that, given a basis of an arbitrary lattice, samples lattice points from a discrete Gaussian probability distribution whose standard deviation is essentially the length of the longest Gram-Schmidt vector of the basis. A crucial security property is that the output distribution of the algorithm is oblivious to the particular geometry of the given basis. Categories and Subject Descriptors F.2.2 [Nonnumerical Algorithms and Problems]: Computations on discrete structures General Terms Theory, Algorithms Keywords Lattice-based cryptography, trapdoor functions Supported by the Herbert Kunzel Stanford Graduate Fellowship. This material is based upon work supported by the National Science Foundation under Grants http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Trapdoors for hard lattices and new cryptographic constructions

Association for Computing Machinery — May 17, 2008

Loading next page...
/lp/association-for-computing-machinery/trapdoors-for-hard-lattices-and-new-cryptographic-constructions-tp5pd00uz2

References (66)

Datasource
Association for Computing Machinery
Copyright
Copyright © 2008 by ACM Inc.
ISBN
978-1-60558-047-0
doi
10.1145/1374376.1374407
Publisher site
See Article on Publisher Site

Abstract

Trapdoors for Hard Lattices and New Cryptographic Constructions (Extended Abstract) Craig Gentry — Stanford University Chris Peikert cpeikert@alum.mit.edu 1. SRI International Vinod Vaikuntanathan ¡ vinodv@mit.edu MIT cgentry@cs.stanford.edu ABSTRACT INTRODUCTION 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 preimage sampling, simple and e ƒcient œhashand-sign  digital signature schemes, and identity-based encryption. A core technical component of our constructions is an ef cient algorithm that, given a basis of an arbitrary lattice, samples lattice points from a discrete Gaussian probability distribution whose standard deviation is essentially the length of the longest Gram-Schmidt vector of the basis. A crucial security property is that the output distribution of the algorithm is oblivious to the particular geometry of the given basis. Categories and Subject Descriptors F.2.2 [Nonnumerical Algorithms and Problems]: Computations on discrete structures General Terms Theory, Algorithms Keywords Lattice-based cryptography, trapdoor functions Supported by the Herbert Kunzel Stanford Graduate Fellowship. This material is based upon work supported by the National Science Foundation under Grants

There are no references for this article.