Chris Peikert

Ph.D. (MIT), 2006
Assistant Professor
School of Computer Science, College of Computing
Georgia Institute of Technology

Email: cpeikert [at] cc [dot] gatech [dot] edu
Office: Klaus 3146
Phone: 404 . 385 . 3264

• Cryptography Group
• GT Information Security Center
• Algorithms and Randomness Center
• Algorithms, Combinatorics, and Optimization Program

Jump to: news — teaching — research.

In 2006 I received my Ph.D. from the MIT Computer Science and Artificial Intelligence Laboratory. My advisor was Silvio Micali.

My research interests include cryptography, lattices, coding theory, algorithms, and computational complexity. A particular focus is on cryptographic schemes whose security can be based on the apparent intractability of lattice problems. Further information may be found in my research summary and curriculum vitae (CV).

Potential graduate students: I am seeking strong, highly motivated PhD students who are interested in theory-oriented cryptography, especially involving novel applications of mathematics and algorithms. If you fit this description, then I encourage you to apply to Georgia Tech! (You may also wish to mention me on your application.) More information can be found at the Crypto group wiki.

I have served on the program committees for: STOC 2010, PQC 2010, CRYPTO 2009, TCC 2008.

News

• I will be speaking on my research at the following upcoming workshops:
  • Number Theory and Cryptography (April 12-16, Montreal)
  • Public-Key Cryptography and the Geometry of Numbers (May 6-7, Amsterdam)
• The Algorithms and Randomness Center at Georgia Tech is seeking postdocs in theoretical computer science for the ARC and Simons fellowships.
• In the Spring 2010 term I will be teaching CS 8803TFC, Theoretical Foundations of Cryptography. Sign up!
• In Fall 2009 I joined the faculty at Georgia Tech, after 3 great years in the Computer Science Laboratory at SRI International.

Teaching

"Good teaching is one-fourth preparation and three-fourths theater." — Gail Godwin

• CS 8803TFC, Theoretical Foundations of Cryptography, Spring 2010

Research

"Research is what I'm doing when I don't know what I'm doing." — Wernher Von Braun

• Bonsai Trees (or, Arboriculture in Lattice-Based Cryptography)
  Chris Peikert.
  To appear, EUROCRYPT 2010.
• On Ideal Lattices and Learning with Errors Over Rings
  Vadim Lyubashevsky, Chris Peikert, Oded Regev.
  To appear, EUROCRYPT 2010.
• Public-Key Encryption Schemes with Auxiliary Inputs
  Yevgeniy Dodis, Shafi Goldwasser, Yael Kalai, Chris Peikert, Vinod Vaikuntanathan.
  In TCC 2010.
• Robustness of the Learning with Errors Assumption
  Shafi Goldwasser, Yael Kalai, Chris Peikert, Vinod Vaikuntanathan.
  In ICS 2010.
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
  Benny Applebaum, David Cash, Chris Peikert, Amit Sahai.
  In CRYPTO 2009.
• Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem [Slides, Video]
  Chris Peikert.
  STOC 2009. Awarded Best Paper; submitted by invitation to Journal of the ACM.
• Some Recent Progress in Lattice-Based Cryptography
  Chris Peikert.
  Slides for invited tutorial at TCC 2009.
• Generating Shorter Bases for Hard Random Lattices
  Joel Alwen, Chris Peikert.
  STACS 2009. Submitted by invitation to Theory of Computing Systems special issue on STACS 2009.
• SWIFFTX: A Proposal for the SHA-3 Standard
  Yuriy Arbitman, Gil Dogon, Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen.
  Submitted to NIST SHA-3 Competition.
• Limits on the Hardness of Lattice Problems in l_p Norms [Slides]
  Chris Peikert.
  By invitation, Computational Complexity special issue on Complexity 2007.
• Lossy Trapdoor Functions and Their Applications [Slides]
  Chris Peikert, Brent Waters.
  In STOC 2008. Submitted by invitation to SIAM Journal on Computing special issue on STOC 2008.
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
  Chris Peikert, Vinod Vaikuntanathan.
  In CRYPTO 2008.
• A Framework for Efficient and Composable Oblivious Transfer [Slides]
  Chris Peikert, Vinod Vaikuntanathan, Brent Waters.
  In CRYPTO 2008.
• Trapdoors for Hard Lattices and New Cryptographic Constructions [Slides]
  Craig Gentry, Chris Peikert, Vinod Vaikuntanathan.
  In STOC 2008.
• SWIFFT: A Modest Proposal for FFT Hashing
  Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen.
  In FSE 2008.
• Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors [Slides]
  Chris Peikert, Alon Rosen.
  In STOC 2007.
• Provably Secure FFT Hashing
  Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen.
  In 2nd NIST Cryptographic Hash Function Workshop, 2006.
• Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices [Slides]
  Chris Peikert, Alon Rosen.
  In TCC 2006.
• On Error Correction in the Exponent [Slides]
  Chris Peikert.
  In TCC 2006.
• Optimal Error Correction Against Computationally Bounded Noise
  Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson.
  In TCC 2005.
• Completely Fair SFE and Coalition-Safe Cheap Talk
  Matt Lepinski, Silvio Micali, Chris Peikert, abhi shelat.
  In PODC 2004.
• Lower Bounds for Collusion-Secure Fingerprinting
  Chris Peikert, Adam Smith, abhi shelat.
  In SODA 2003.
• Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes
  Anna Lysyanskaya, Chris Peikert.
  In ASIACRYPT 2001.
• March Madness is (NP-)Hard
  David Liben-Nowell, Moses Liskov, Chris Peikert, abhi shelat, Adam Smith, Grant Wang.
  Unpublished manuscript.