Trapdoors for hard lattices and new cryptographic constructions C Gentry, C Peikert, V Vaikuntanathan Proceedings of the fortieth annual ACM symposium on Theory of computing, 197-206, 2008 | 2925 | 2008 |
On ideal lattices and learning with errors over rings V Lyubashevsky, C Peikert, O Regev Advances in Cryptology–EUROCRYPT 2010: 29th Annual International Conference …, 2010 | 2312 | 2010 |
Trapdoors for lattices: Simpler, tighter, faster, smaller D Micciancio, C Peikert Annual International Conference on the Theory and Applications of …, 2012 | 1413 | 2012 |
Public-key cryptosystems from the worst-case shortest vector problem C Peikert Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 1190 | 2009 |
Bonsai trees, or how to delegate a lattice basis D Cash, D Hofheinz, E Kiltz, C Peikert Journal of cryptology 25, 601-639, 2012 | 1103 | 2012 |
Better key sizes (and attacks) for LWE-based encryption R Lindner, C Peikert Topics in Cryptology–CT-RSA 2011: The Cryptographers’ Track at the RSA …, 2011 | 952 | 2011 |
A framework for efficient and composable oblivious transfer C Peikert, V Vaikuntanathan, B Waters Annual international cryptology conference, 554-571, 2008 | 874 | 2008 |
On ideal lattices and learning with errors over rings V Lyubashevsky, C Peikert, O Regev Journal of the ACM (JACM) 60 (6), 1-35, 2013 | 835 | 2013 |
Classical hardness of learning with errors Z Brakerski, A Langlois, C Peikert, O Regev, D Stehlé Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 815 | 2013 |
Fast cryptographic primitives and circular-secure encryption based on hard learning problems B Applebaum, D Cash, C Peikert, A Sahai Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009 | 775 | 2009 |
Lossy trapdoor functions and their applications C Peikert, B Waters Proceedings of the fortieth annual ACM symposium on Theory of computing, 187-196, 2008 | 753 | 2008 |
A decade of lattice cryptography C Peikert Foundations and trends® in theoretical computer science 10 (4), 283-424, 2016 | 690 | 2016 |
Pseudorandom functions and lattices A Banerjee, C Peikert, A Rosen Annual International Conference on the Theory and Applications of …, 2012 | 606 | 2012 |
A toolkit for ring-LWE cryptography V Lyubashevsky, C Peikert, O Regev Annual international conference on the theory and applications of …, 2013 | 546 | 2013 |
Lattice cryptography for the internet C Peikert International workshop on post-quantum cryptography, 197-219, 2014 | 507 | 2014 |
An efficient and parallel Gaussian sampler for lattices C Peikert Annual Cryptology Conference, 80-97, 2010 | 457 | 2010 |
Hardness of SIS and LWE with small parameters D Micciancio, C Peikert Annual cryptology conference, 21-39, 2013 | 402 | 2013 |
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices C Peikert, A Rosen Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006 …, 2006 | 392 | 2006 |
Faster bootstrapping with polynomial error J Alperin-Sheriff, C Peikert Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014 | 389 | 2014 |
Generating shorter bases for hard random lattices J Alwen, C Peikert Theory of Computing Systems 48, 535-553, 2011 | 365 | 2011 |