Obserwuj
Chris Peikert
Chris Peikert
Professor, Computer Science and Engineering, University of Michigan
Zweryfikowany adres z alum.mit.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
33802013
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
31742008
Trapdoors for lattices: Simpler, tighter, faster, smaller
D Micciancio, C Peikert
Annual International Conference on the Theory and Applications of …, 2012
15732012
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
12472009
Bonsai trees, or how to delegate a lattice basis
D Cash, D Hofheinz, E Kiltz, C Peikert
Journal of cryptology 25, 601-639, 2012
11822012
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
9942011
A framework for efficient and composable oblivious transfer
C Peikert, V Vaikuntanathan, B Waters
Annual international cryptology conference, 554-571, 2008
9222008
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
8912013
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
8312009
A decade of lattice cryptography
C Peikert
Foundations and trends® in theoretical computer science 10 (4), 283-424, 2016
7832016
Lossy trapdoor functions and their applications
C Peikert, B Waters
Proceedings of the fortieth annual ACM symposium on Theory of computing, 187-196, 2008
7812008
Pseudorandom functions and lattices
A Banerjee, C Peikert, A Rosen
Annual International Conference on the Theory and Applications of …, 2012
6642012
A toolkit for ring-LWE cryptography
V Lyubashevsky, C Peikert, O Regev
Annual international conference on the theory and applications of …, 2013
6052013
Lattice cryptography for the internet
C Peikert
International workshop on post-quantum cryptography, 197-219, 2014
5392014
An efficient and parallel Gaussian sampler for lattices
C Peikert
Annual Cryptology Conference, 80-97, 2010
4952010
Hardness of SIS and LWE with small parameters
D Micciancio, C Peikert
Annual cryptology conference, 21-39, 2013
4492013
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
4332006
Faster bootstrapping with polynomial error
J Alperin-Sheriff, C Peikert
Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014
4292014
Generating shorter bases for hard random lattices
J Alwen, C Peikert
Theory of Computing Systems 48, 535-553, 2011
3892011
Generating shorter bases for hard random lattices
J Alwen, C Peikert
26th International Symposium on Theoretical Aspects of Computer Science …, 2009
3642009
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20