• What's new
• Archive
• Best Papers
• Videos
• Authors
• Coauthors
• By year
• By conference
• All Committees
• Most Committees
• Report errors
• Maps
• About

Chris Peikert  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2013	Hardness of SIS and LWE with Small Parameters	crypto	21-39
2	2013	Practical Bootstrapping in Quasilinear Time	crypto	1-20
3	2013	A Toolkit for Ring-LWE Cryptography	eurocrypt	35-54
4	2012	Circular and KDM Security for Identity-Based Encryption	pkc	334-352
5	2012	Identity-Based (Lossy) Trapdoor Functions and Applications	eurocrypt	228-245
6	2012	Pseudorandom Functions and Lattices	eurocrypt	719-737
7	2012	Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller	eurocrypt	700-718
8	2011	Bi-Deniable Public-Key Encryption	crypto	521
9	2010	Public-Key Encryption Schemes with Auxiliary Inputs	tcc	361-381
10	2010	An Efficient and Parallel Gaussian Sampler for Lattices	crypto	80-97
11	2010	Bonsai Trees, or How to Delegate a Lattice Basis	eurocrypt	523-552
12	2010	On Ideal Lattices and Learning with Errors over Rings	eurocrypt	1-23
13	2010	An Efficient and Parallel Gaussian Sampler for Lattices	eprint	online
14	2009	Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems	crypto	595-618
15	2009	Some Recent Progress in Lattice-Based Cryptography	tcc	72
16	2008	SWIFFT: A Modest Proposal for FFT Hashing	fse	online
17	2008	A Framework for Efficient and Composable Oblivious Transfer	crypto	554-571
18	2008	Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems	crypto	536-553
19	2008	Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem	eprint	online
20	2008	Generating Shorter Bases for Hard Random Lattices	eprint	online
21	2007	A Framework for Efficient and Composable Oblivious Transfer	eprint	online
22	2007	Trapdoors for Hard Lattices and New Cryptographic Constructions	eprint	online
23	2007	Lossy Trapdoor Functions and Their Applications	eprint	online
24	2006	On Error Correction in the Exponent	tcc	online
25	2006	Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices	tcc	online
26	2006	Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors	eprint	online
27	2005	Optimal Error Correction Against Computationally Bounded Noise	tcc	online
28	2005	On Error Correction in the Exponent	eprint	online
29	2001	Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes	asiacrypt	331-350