Assistant Computer Science
Resume:
Chris Peikert
Curriculum Vitae
SRI International ********@****.***.***
Computer Science Laboratory o ce: +1-650-***-****
*** ********** ***. ****: +1-650-***-****
Menlo Park, CA 94043 http://people.csail.mit.edu/cpeikert/
Scienti c Interests
Cryptography, lattices, error-correcting codes, algorithms, complexity, computer and network security.
Education
Massachusetts Institute of Technology
Ph.D. in Computer Science, July 2006.
Advisor: Silvio Micali
Thesis: Cryptographic Error Correction.
GPA: 5.0/5.0
Massachusetts Institute of Technology
Master of Engineering in Computer Science, June 2001.
GPA: 5.0/5.0
Massachusetts Institute of Technology
Bachelor of Science in Mathematics, June 2000.
GPA: 4.9/5.0, 5.0 in major
Work Experience
SRI International (Stanford Research Institute), Menlo Park, CA.
Computer Science Laboratory, August 2006 to present.
Massachusetts Institute of Technology, Cambridge, MA.
Research Assistant, Computer Science and Arti cial Intelligence Laboratory, Sep 2002 to May 2006.
Teaching Assistant, Network and Computer Security, Fall 2005 (taught by Sha Goldwasser).
Teaching Assistant, Cryptography and Cryptanalysis, Spring 2004 (taught by Silvio Micali).
Teaching Assistant, Network and Computer Security, Fall 2003 (taught by Ron Rivest).
Teaching Assistant, Cryptography and Computer Security, Summer 2002 (taught by Sha Goldwasser).
Teaching Assistant, Introduction to Algorithms, Fall 2002 (taught by Sha Goldwasser).
Teaching Assistant, Introduction to Algorithms, Spring 2001 (taught by Madhu Sudan).
Teaching Assistant, Structure and Interpretation of Computer Programs, Fall 2000.
1
Publications
[1] Chris Peikert. Public key cryptosystems from the worst-case shortest vector problem. In Proceedings of
STOC 09 (Symposium on Theory of Computing), 2009. Accepted.
[2] Jo l Alwen and Chris Peikert. Generating shorter bases for hard random lattices. In Proceedings of
e
STACS 09 (Symposium on Theoretical Aspects of Computer Science), 2009. Accepted.
[3] Yuriy Arbitman, Gil Dogon, Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, and Alon Rosen.
SWIFFTX: A proposal for the SHA-3 standard. Submitted to NIST SHA-3 competition, 2008.
[4] Chris Peikert, Vinod Vaikuntanathan, and Brent Waters. A framework for e cient and composable
oblivious transfer. In Proceedings of CRYPTO 08, pages 554 571, 2008.
[5] Chris Peikert and Vinod Vaikuntanathan. Noninteractive statistical zero-knowledge proofs for lattice
problems. In Proceedings of CRYPTO 08, pages 536 553, 2008.
[6] Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. Trapdoors for hard lattices and new cryp-
tographic constructions. In Proceedings of STOC 08 (Symposium on Theory of Computing), pages
197 206, 2008.
[7] Chris Peikert and Brent Waters. Lossy trapdoor functions and their applications. In Proceedings of
STOC 08 (Symposium on Theory of Computing), pages 187 196, 2008. Invited to SIAM Journal on
Computing special issue on STOC 08.
[8] Chris Peikert. Limits on the hardness of lattice problems in p norms. Computational Complexity,
17(2):300 351, May 2008. By invitation to special issue on CCC 07 (Conference on Computational
Complexity).
[9] Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, and Alon Rosen. SWIFFT: A modest proposal
for FFT hashing. In Proceedings of FSE 08 (Fast Software Encryption), pages 54 72, 2008.
[10] Chris Peikert and Alon Rosen. Lattices that admit logarithmic worst-case to average-case connection
factors. In Proceedings of STOC 07 (Symposium on Theory of Computing), pages 478 487, 2007.
[11] Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, and Alon Rosen. Provably secure FFT hashing.
NIST 2nd Cryptographic Hash Workshop, August 2006.
[12] Chris Peikert and Alon Rosen. E cient collision-resistant hashing from worst-case assumptions on cyclic
lattices. In Proceedings of TCC 06 (Theory of Cryptography Conference), pages 145 166, March 2006.
[13] Chris Peikert. On error correction in the exponent. In Proceedings of TCC 06 (Theory of Cryptography
Conference), pages 167 183, 2006.
[14] Silvio Micali, Chris Peikert, Madhu Sudan, and David A. Wilson. Optimal error correction against
computationally bounded noise. In Proceedings of TCC 05 (Theory of Cryptography Conference),
pages 1 16, 2005.
[15] Matt Lepinski, Silvio Micali, Chris Peikert, and Abhi Shelat. Completely fair SFE and coalition-safe
cheap talk. In Proceedings of PODC 04 (Symposium on Principles of Distributed Computing), pages
1 10, 2004.
[16] Chris Peikert, Abhi Shelat, and Adam Smith. Lower bounds for collusion-secure ngerprinting. In
Proceedings of SODA 03 (Symposium on Discrete Algorithms), pages 472 479, 2003.
[17] Anna Lysyanskaya and Chris Peikert. Adaptive security in the threshold setting: From cryptosystems
to signature schemes. In Proceedings of ASIACRYPT 01, pages 331 350, 2001.
2
Invited Talks
Recent Progress in Lattice-Based Cryptography
[1] Invited tutorial (to be given), 6th Theory of Cryptography Conference (TCC), 15 Mar 2009
Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem
[2] Schloss Dagstuhl, Germany, 1 Dec 2008
[3] Massachusetts Institute of Technology, 21 Nov 2008
How to Use a Short Basis: New Lattice-Based Cryptographic Constructions
[4] Carnegie Mellon University, 5 Dec 2008
[5] Bay Area Theory Symposium, 7 Nov 2008
[6] STOC 08, Victoria, Canada, 18 May 2008.
[7] Georgia Institute of Technology, 11 Mar 2008
[8] Massachusetts Institute of Technology, 9 Nov 2007
[9] University of Maryland, 8 Nov 2007
[10] Penn State University, 6 Nov 2007
A Framework for E cient and Composable Oblivious Transfer
[11] CRYPTO 08, Santa Barbara, CA, 21 Aug 2008.
[12] Georgia Institute of Technology, 11 Mar 2008.
Lossy Trapdoor Functions and Their Applications
[13] Microsoft Research Silicon Valley, 12 Jun 2008
[14] Columbia University, 13 Mar 2008
[15] University of California, San Diego, 21 Nov 2007
[16] University of California, Berkeley, 10 Sep 2007
Limits on the Hardness of Lattice Problems in Norms
p
[17] Complexity 07, San Diego, CA, 16 Jun 2007.
Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors
[18] STOC 07, San Diego, CA, 12 Jun 2007.
E cient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices
[19] TCC 06, New York, NY, 5 Mar 2006.
[20] Massachusetts Institute of Technology, 2 Dec 2005.
On Error Correction in the Exponent
[21] TCC 06, New York, NY, 5 Mar 2006.
Optimal Error Correction Against Computationally Bounded Noise
[22] TCC 05, Cambridge, MA, 10 Feb 2005.
[23] Massachusetts Institute of Technology, 15 Oct 2004.
Lower Bounds for Collusion-Secure Fingerprinting
[24] SODA 03, Baltimore, MD, 13 Jan 2003.
Adaptive Security in the Threshold Setting
[25] ASIACRYPT 01, Gold Coast, Australia, 12 Dec 2001.
3
Grants
Principal Investigator, NSF Grant #CNS-0716786, E cient Cryptography Based on Lattices, $192,000
Co-PI, NSF Grant #CNS-0749931, Securing the Computing and Information Future: Principled
Foundations and New Cryptographic Abstractions, $200,000
Co-PI, I3P Grant Safeguarding Digital Identity, $325,000
Students Supervised
Masters Students
David A. Wilson, MIT, 2004 to 2005. Co-advisor.
Summer Students
Andrew Wan, Columbia University, Summer 2008.
Jo l Alwen, New York University, Summer 2008.
e
Vinod Vaikuntanathan, MIT, Summer 2007.
Awards and Honors
MIT Presidential Fellowship, 2001 2002.
First Place, MIT ACM-IEEE Programming Contest (6.370), January 2001.
Professional Activities
Program Committee CRYPTO, 2009
Member TCC (Theory of Cryptography Conference), 2008
Journal Referee Journal of the ACM
IACR Journal of Cryptology
IEEE Transactions on Signal Processing
Conference Referee FOCS (Symposium on Foundations of Computer Science), 2005, 2007, 2008
STOC (Symposium on Theory of Computing), 2009
CRYPTO, 2002, 2003, 2008
EUROCRYPT, 2004, 2007, 2008, 2009
TCC (Theory of Cryptography Conference), 2005, 2007, 2009
SODA (Symposium on Discrete Algorithms), 2008, 2009
CCS (Computer and Communications Security), 2005
DRM (Workshop on Digital Rights Management), 2005
PKC (International Workshop on Public Key Cryptography), 2005
4
Contact this candidate