Documents Related by Co-Citation

103 Trapdoors for Hard Lattices and New Cryptographic Constructions – Craig Gentry, Chris Peikert, Vinod Vaikuntanathan - 2007
279 Fully homomorphic encryption using ideal lattices – Craig Gentry - 2009
45 Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices – Chris Peikert, Alon Rosen - 2006
197 On Lattices, Learning with Errors, Random Linear Codes, and Cryptography – Oded Regev - 2005
19 Lattice-Based Identification Schemes Secure Under Active Attacks – Vadim Lyubashevsky - 2008
82 Public-key cryptosystems from the worst-case shortest vector problem – Chris Peikert - 2008
41 Generalized compact knapsacks are collision resistant – Vadim Lyubashevsky, Daniele Micciancio - 2006
17 Asymptotically efficient lattice-based digital signatures – Vadim Lyubashevsky, Daniele Micciancio - 2008
700 Factoring polynomials with rational coefficients – A. K. Lenstra, H. W. Lenstra - 1982
38 Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems – Benny Applebaum, David Cash, Chris Peikert, Amit Sahai
163 Generating hard instances of lattice problems – M Ajtai - 1996
83 Worst-case to average-case reductions based on Gaussian measures – Daniele Micciancio, Oded Regev - 2004
47 Generalized compact knapsacks, cyclic lattices, and efficient one-way functions – Daniele Micciancio - 2007
84 Lossy Trapdoor Functions and Their Applications – Chris Peikert, Brent Waters - 2007
19 Lattices that admit logarithmic worst-case to averagecase connection factors – Chris Peikert, Alon Rosen - 2007
55 Predicting lattice reduction – N Gama, P Q Nguyen
23 Better key sizes (and attacks) for LWE-based encryption – Richard Lindner, Chris Peikert - 2011
35 Lattice-based Cryptography – Daniele Micciancio, Oded Regev - 2008
207 A public-key cryptosystem with worst-case/average-case equivalence – Miklos Ajtai, Cynthia Dwork - 1997