Chris Peikert

Cited by

	All	Since 2018
Citations	21337	12648
h-index	50	41
i10-index	73	69

2400

1200

600

1800

2008200920102011201220132014201520162017201820192020202120222023124 230 332 471 667 782 1161 1337 1592 1748 2092 2101 2244 2198 2320 1692

Public access

View all

28 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Vadim LyubashevskyIBM Research Europe, ZurichVerified email at zurich.ibm.com
Vinod VaikuntanathanProfessor of Computer Science, Massachusetts Institute of TechnologyVerified email at csail.mit.edu
Craig GentryCTO TripleBlindVerified email at tripleblind.ai
Daniele MicciancioProfessor of computer science, UCSDVerified email at eng.ucsd.edu
Oded RegevProfessor of Computer ScienceVerified email at cims.nyu.edu
Alon RosenBocconi UniversityVerified email at unibocconi.it
Brent WatersUniversity of Texas at AustinVerified email at cs.utexas.edu
Abhishek BanerjeeGeorgia Institute of TechnologyVerified email at cc.gatech.edu
David CashUniversity of ChicagoVerified email at cs.uchicago.edu
Amit SahaiSymantec Chair Professor of Computer Science; Professor of Mathematics (by courtesy), UCLAVerified email at cs.ucla.edu
Sina ShiehianSnap Inc.Verified email at umich.edu
Eike KiltzProfessor of Computer Science, Ruhr-Universität BochumVerified email at rub.de
Jacob Alperin-SheriffGeorgia Institute of TechnologyVerified email at gatech.edu
abhi shelatProfessor of Computer ScienceVerified email at neu.edu
Srinivas DevadasEdwin Sibley Webster Professor of Electrical Engineering and Computer Science, MITVerified email at mit.edu
Daniel SanchezMassachusetts Institute of TechnologyVerified email at csail.mit.edu
Nikola SamardzicMassachusetts Institute of TechnologyVerified email at mit.edu
Aleksandar KrastevMITVerified email at csail.mit.edu
Yael Tauman KalaiMicrosoft Research, MITVerified email at microsoft.com
Dennis HofheinzDepartment of Computer Science, ETH ZürichVerified email at inf.ethz.ch

Chris Peikert

Professor, Computer Science and Engineering, University of Michigan

Verified email at alum.mit.edu - Homepage

Cryptography


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	2646	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	2038	2010
Trapdoors for lattices: Simpler, tighter, faster, smaller D Micciancio, C Peikert Annual International Conference on the Theory and Applications of …, 2012	1254	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	1101	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	1018	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	881	2011
A framework for efficient and composable oblivious transfer C Peikert, V Vaikuntanathan, B Waters Annual international cryptology conference, 554-571, 2008	825	2008
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	750	2013
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	733	2013
Lossy trapdoor functions and their applications C Peikert, B Waters Proceedings of the fortieth annual ACM symposium on Theory of computing, 187-196, 2008	724	2008
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	708	2009
Generating shorter bases for hard random lattices J Alwen, C Peikert Theory of Computing Systems 48, 535-553, 2011	649	2011
A decade of lattice cryptography C Peikert Foundations and trends® in theoretical computer science 10 (4), 283-424, 2016	585	2016
Pseudorandom functions and lattices A Banerjee, C Peikert, A Rosen Annual International Conference on the Theory and Applications of …, 2012	527	2012
A toolkit for ring-LWE cryptography V Lyubashevsky, C Peikert, O Regev Advances in Cryptology–EUROCRYPT 2013: 32nd Annual International Conference …, 2013	504	2013
Lattice cryptography for the internet C Peikert International workshop on post-quantum cryptography, 197-219, 2014	468	2014
An efficient and parallel Gaussian sampler for lattices C Peikert Annual Cryptology Conference, 80-97, 2010	410	2010
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	365	2006
Hardness of SIS and LWE with small parameters D Micciancio, C Peikert Annual cryptology conference, 21-39, 2013	361	2013
Faster bootstrapping with polynomial error J Alperin-Sheriff, C Peikert Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa …, 2014	355	2014

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors