Folgen
Chris Peikert
Chris Peikert
Professor, Computer Science and Engineering, University of Michigan
Bestätigte E-Mail-Adresse bei alum.mit.edu - Startseite
Titel
Zitiert von
Zitiert von
Jahr
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
25472008
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
24982013
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.
D Micciancio, C Peikert
Eurocrypt 7237, 700-718, 2012
11982012
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
10732009
Bonsai trees, or how to delegate a lattice basis
D Cash, D Hofheinz, E Kiltz, C Peikert
Journal of cryptology 25, 601-639, 2012
10362012
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
8642011
A framework for efficient and composable oblivious transfer
C Peikert, V Vaikuntanathan, B Waters
Advances in Cryptology–CRYPTO 2008: 28th Annual International Cryptology …, 2008
8062008
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
7262013
Lossy trapdoor functions and their applications
C Peikert, B Waters
Proceedings of the fortieth annual ACM symposium on Theory of computing, 187-196, 2008
7042008
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
6902009
A decade of lattice cryptography
C Peikert
Foundations and Trends® in Theoretical Computer Science 10 (4), 283-424, 2016
5572016
Pseudorandom functions and lattices
A Banerjee, C Peikert, A Rosen
Advances in Cryptology–EUROCRYPT 2012: 31st Annual International Conference …, 2012
5062012
A toolkit for ring-LWE cryptography
V Lyubashevsky, C Peikert, O Regev
Advances in Cryptology–EUROCRYPT 2013: 32nd Annual International Conference …, 2013
4892013
Lattice cryptography for the internet
C Peikert
Post-Quantum Cryptography: 6th International Workshop, PQCrypto 2014 …, 2014
4502014
An efficient and parallel Gaussian sampler for lattices
C Peikert
Advances in Cryptology–CRYPTO 2010: 30th Annual Cryptology Conference, Santa …, 2010
3982010
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
3572006
Faster bootstrapping with polynomial error
J Alperin-Sheriff, C Peikert
Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014
3462014
Hardness of SIS and LWE with small parameters
D Micciancio, C Peikert
Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa …, 2013
3462013
Generating shorter bases for hard random lattices
J Alwen, C Peikert
Cryptology ePrint Archive, 2008
3402008
Generating shorter bases for hard random lattices
J Alwen, C Peikert
Theory of Computing Systems 48, 535-553, 2011
3042011
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20