Chris Peikert

	2009
24		Benny Applebaum, David Cash, Chris Peikert, Amit Sahai: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems. CRYPTO 2009: 595-618
23		Joël Alwen, Chris Peikert: Generating Shorter Bases for Hard Random Lattices. STACS 2009: 75-86
22		Chris Peikert: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. STOC 2009: 333-342
21		Chris Peikert: Some Recent Progress in Lattice-Based Cryptography. TCC 2009: 72
	2008
20		Chris Peikert, Vinod Vaikuntanathan: Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems. CRYPTO 2008: 536-553
19		Chris Peikert, Vinod Vaikuntanathan, Brent Waters: A Framework for Efficient and Composable Oblivious Transfer. CRYPTO 2008: 554-571
18		Vadim Lyubashevsky, Daniele Micciancio, Chris Peikert, Alon Rosen: SWIFFT: A Modest Proposal for FFT Hashing. FSE 2008: 54-72
17		Chris Peikert, Brent Waters: Lossy trapdoor functions and their applications. STOC 2008: 187-196
16		Craig Gentry, Chris Peikert, Vinod Vaikuntanathan: Trapdoors for hard lattices and new cryptographic constructions. STOC 2008: 197-206
15		Chris Peikert: Limits on the Hardness of Lattice Problems in lp Norms. Computational Complexity 17(2): 300-351 (2008)
14		Chris Peikert: Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. Electronic Colloquium on Computational Complexity (ECCC) 15(100): (2008)
	2007
13		Chris Peikert: Limits on the Hardness of Lattice Problems in ell _p Norms. IEEE Conference on Computational Complexity 2007: 333-346
12		Chris Peikert, Alon Rosen: Lattices that admit logarithmic worst-case to average-case connection factors. STOC 2007: 478-487
11		Chris Peikert, Brent Waters: Lossy Trapdoor Functions and Their Applications. Electronic Colloquium on Computational Complexity (ECCC) 14(080): (2007)
10		Craig Gentry, Chris Peikert, Vinod Vaikuntanathan: Trapdoors for Hard Lattices and New Cryptographic Constructions. Electronic Colloquium on Computational Complexity (ECCC) 14(133): (2007)
	2006
9		Chris Peikert, Alon Rosen: Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices. TCC 2006: 145-166
8		Chris Peikert: On Error Correction in the Exponent. TCC 2006: 167-183
7		Chris Peikert, Alon Rosen: Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors. Electronic Colloquium on Computational Complexity (ECCC) 13(147): (2006)
6		Chris Peikert: Limits on the Hardness of Lattice Problems in $\ell_p$ Norms. Electronic Colloquium on Computational Complexity (ECCC) 13(148): (2006)
	2005
5		Silvio Micali, Chris Peikert, Madhu Sudan, David A. Wilson: Optimal Error Correction Against Computationally Bounded Noise. TCC 2005: 1-16
4		Chris Peikert, Alon Rosen: Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices Electronic Colloquium on Computational Complexity (ECCC)(158): (2005)
	2004
3		Matt Lepinski, Silvio Micali, Chris Peikert, Abhi Shelat: Completely fair SFE and coalition-safe cheap talk. PODC 2004: 1-10
	2003
2		Chris Peikert, Abhi Shelat, Adam Smith: Lower bounds for collusion-secure fingerprinting. SODA 2003: 472-479
	2001
1		Anna Lysyanskaya, Chris Peikert: Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes. ASIACRYPT 2001: 331-350

Coauthor Index

1	Joël Alwen	[23]
2	Benny Applebaum	[24]
3	David Cash	[24]
4	Craig Gentry	[10] [16]
5	Matt Lepinski	[3]
6	Anna Lysyanskaya	[1]
7	Vadim Lyubashevsky	[18]
8	Silvio Micali	[3] [5]
9	Daniele Micciancio	[18]
10	Alon Rosen	[4] [7] [9] [12] [18]
11	Amit Sahai	[24]
12	Abhi Shelat	[2] [3]
13	Adam Smith	[2]
14	Madhu Sudan	[5]
15	Vinod Vaikuntanathan (V. Vinod)	[10] [16] [19] [20]
16	Brent Waters (Brent R. Waters)	[11] [17] [19]
17	David A. Wilson	[5]