Chris Peikert

I am now employed in the Computer Science Laboratory at SRI International. This page may disappear/relocate soon.

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

My research interests include cryptography, lattices, coding theory, algorithms, and computational complexity.

I attended MIT as an undergrad, receiving an S.B. in Mathematics in 2000, and a Masters of Engineering in Computer Science in 2001.

You may be interested in my curriculum vitae or research summary.

You can jump directly to my -- research -- teaching -- coursework -- readings.

Research

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

Newer

• Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem [Slides]
  Chris Peikert.
  Submitted.
• Generating Shorter Bases for Hard Random Lattices
  Joel Alwen, Chris Peikert.
  To appear, 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 17(2):300-351 (May 2008). Preliminary version in 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.

Older

• 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.

Theses

• PhD thesis: Cryptographic Error Correction.
• Masters thesis: Adaptive Security in the Threshold Setting: From Cryptosystems to Signatures.

Teaching

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

I have been a teaching assistant for:

• 6.857: Network and Computer Security (Fall 2005), taught by Shafi Goldwasser
• 6.875: Cryptography and Cryptanalysis (Spring 2004), taught by Silvio Micali
• 6.857: Network and Computer Security (Fall 2003), taught by Ron Rivest
• 6.046: Introduction to Algorithms (Fall 2002) (head TA), taught by Erik Demaine and Shafi Goldwasser
• 6.87s: Cryptography and Computer Security (Summer 2002), taught by Shafi Goldwasser and Mihir Bellare.
• 6.046: Introduction to Algorithms (Spring 2001), taught by Madhu Sudan and Piotr Indyk
• 6.001: Structure and Interpretation of Computer Programs (Fall 2000), taught by Eric Grimson

Coursework

"I never let my schooling interfere with my education." -- Mark Twain

Notable classes I've taken, with links (where available):

• 6.897: Algorithmic Introduction to Coding Theory (Fall 2001),
• 6.854: Advanced Algorithms (Fall 2001),
• 6.897: Selected Topics in Cryptography (Spring 2004),
• 6.876: Advanced Topics in Cryptography (Spring 2001, Spring 2003, Fall 2004),
• 6.856: Randomized Algorithms (Fall 2000),
• 6.875: Cryptography and Cryptanalysis (Fall 1999),
• 6.841: Advanced Complexity Theory (Spring 1999),
• 6.840: Theory of Computation (Fall 1997),
• Harvard CS225: Pseudorandomness (Spring 2002, Listener),
• 18.419: Random Walks and Polynomial-Time Algorithms (Spring 2002),
• 18.904: Seminar in Algebraic Topology (Spring 2000),
• 18.901: Topology (Fall 1999),
• 18.701/702: Algebra I/II (Fall 1997/Spring 1998),
• 18.101: Analysis on Manifolds (Spring 2000),
• 15.099: Special Seminar in Operations Research: Proofs from The Book (Fall 2002)

You might also be interested in the Theory of Computation Calendar.

Readings

"Thank you for sending me a copy of your book - I'll waste no time in reading it." -- Moses Hadas

Occasionally I get my hands on a good book of fiction, and (even less occasionally) have time to read it. Here are some of the better ones, with links:

• 41 Stories by O. Henry, by O. Henry
• Selected Short Stories, by Guy De Maupassant
• Fifth Business and The Manticore, by Robertson Davies (World of Wonders would finish off The Deptford Trilogy)
• 1984, by George Orwell
• Frankenstein, by Mary Shelley
• Pride and Prejudice, by Jane Austen
• The Grapes of Wrath, by John Steinbeck
• A Confederacy of Dunces, by John Kennedy Toole
• Uncle Tom's Cabin, by Harriet Beecher Stowe
• A Prayer for Owen Meany, and the less-outstanding-but-still-good A Widow for One Year, by John Irving
• The Diamond Age, by Neal Stephenson.
• Red Sky At Morning, by Richard Bradford.
• "Surely You're Joking, Mr. Feynman!", by Richard Feynman (must be fiction; these stories are over the top)
• Gödel, Escher, Bach: An Eternal Golden Braid, by Douglas R. Hofstadter (non-fiction, but very good)