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
23682008
On ideal lattices and learning with errors over rings
V Lyubashevsky, C Peikert, O Regev
Annual international conference on the theory and applications of …, 2010
17442010
Trapdoors for lattices: Simpler, tighter, faster, smaller
D Micciancio, C Peikert
Annual International Conference on the Theory and Applications of …, 2012
10892012
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
10312009
Bonsai trees, or how to delegate a lattice basis
D Cash, D Hofheinz, E Kiltz, C Peikert
Journal of cryptology 25 (4), 601-639, 2012
9892012
Better key sizes (and attacks) for LWE-based encryption
R Lindner, C Peikert
Cryptographers’ Track at the RSA Conference, 319-339, 2011
8182011
A framework for efficient and composable oblivious transfer
C Peikert, V Vaikuntanathan, B Waters
Annual international cryptology conference, 554-571, 2008
7572008
Lossy trapdoor functions and their applications
C Peikert, B Waters
Proceedings of the fortieth annual ACM symposium on Theory of computing, 187-196, 2008
6892008
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
6782013
Fast cryptographic primitives and circular-secure encryption based on hard learning problems
B Applebaum, D Cash, C Peikert, A Sahai
Annual International Cryptology Conference, 595-618, 2009
6552009
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
6092013
Generating shorter bases for hard random lattices
J Alwen, C Peikert
Theory of Computing Systems 48 (3), 535-553, 2011
5962011
A decade of lattice cryptography
C Peikert
Foundations and trends® in theoretical computer science 10 (4), 283-424, 2016
4922016
Pseudorandom functions and lattices
A Banerjee, C Peikert, A Rosen
Annual International Conference on the Theory and Applications of …, 2012
4542012
A toolkit for ring-LWE cryptography
V Lyubashevsky, C Peikert, O Regev
Annual international conference on the theory and applications of …, 2013
4472013
Lattice cryptography for the internet
C Peikert
International workshop on post-quantum cryptography, 197-219, 2014
4272014
An efficient and parallel Gaussian sampler for lattices
C Peikert
Annual Cryptology Conference, 80-97, 2010
3662010
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices
C Peikert, A Rosen
Theory of Cryptography Conference, 145-166, 2006
3332006
Hardness of SIS and LWE with small parameters
D Micciancio, C Peikert
Annual Cryptology Conference, 21-39, 2013
3262013
Faster bootstrapping with polynomial error
J Alperin-Sheriff, C Peikert
Annual Cryptology Conference, 297-314, 2014
3162014
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20