• 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	2016	Three's Compromised Too: Circular Insecurity for Any Cycle Length from (Ring-)LWE	crypto	659-680
2	2016	Recovering Short Generators of Principal Ideals in Cyclotomic Rings	eurocrypt	559-585
3	2015	Recovering Short Generators of Principal Ideals in Cyclotomic Rings	eprint	313
4	2015	A Decade of Lattice Cryptography	eprint	939
5	2015	Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs	jofc	820-843
6	2015	Key-Homomorphic Constrained Pseudorandom Functions	eprint	180
7	2015	Key-Homomorphic Constrained Pseudorandom Functions	tcc	31-60
8	2014	Faster Bootstrapping with Polynomial Error	crypto	297-314
9	2014	New and Improved Key-Homomorphic Pseudorandom Functions	crypto	353-370
10	2014	SPRING: Fast Pseudorandom Functions from Rounded Ring Products	fse	38-57
11	2014	New and Improved Key-Homomorphic Pseudorandom Functions	eprint	74
12	2014	Faster Bootstrapping with Polynomial Error	eprint	94
13	2014	Lattice Cryptography for the Internet	eprint	70
14	2013	Hardness of SIS and LWE with Small Parameters	crypto	21-39
15	2013	Practical Bootstrapping in Quasilinear Time	crypto	1-20
16	2013	A Toolkit for Ring-LWE Cryptography	eurocrypt	35-54
17	2012	Circular and KDM Security for Identity-Based Encryption	pkc	334-352
18	2012	Identity-Based (Lossy) Trapdoor Functions and Applications	eurocrypt	228-245
19	2012	Pseudorandom Functions and Lattices	eurocrypt	719-737
20	2012	Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller	eurocrypt	700-718
21	2011	Bi-Deniable Public-Key Encryption	crypto	521
22	2010	Public-Key Encryption Schemes with Auxiliary Inputs	tcc	361-381
23	2010	An Efficient and Parallel Gaussian Sampler for Lattices	crypto	80-97
24	2010	Bonsai Trees, or How to Delegate a Lattice Basis	eurocrypt	523-552
25	2010	On Ideal Lattices and Learning with Errors over Rings	eurocrypt	1-23
26	2010	An Efficient and Parallel Gaussian Sampler for Lattices	eprint	online
27	2009	Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems	crypto	595-618
28	2009	Some Recent Progress in Lattice-Based Cryptography	tcc	72
29	2008	SWIFFT: A Modest Proposal for FFT Hashing	fse	online
30	2008	A Framework for Efficient and Composable Oblivious Transfer	crypto	554-571
31	2008	Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems	crypto	536-553
32	2008	Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem	eprint	online
33	2008	Generating Shorter Bases for Hard Random Lattices	eprint	online
34	2007	A Framework for Efficient and Composable Oblivious Transfer	eprint	online
35	2007	Trapdoors for Hard Lattices and New Cryptographic Constructions	eprint	online
36	2007	Lossy Trapdoor Functions and Their Applications	eprint	online
37	2006	On Error Correction in the Exponent	tcc	online
38	2006	Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices	tcc	online
39	2006	Lattices that Admit Logarithmic Worst-Case to Average-Case Connection Factors	eprint	online
40	2005	Optimal Error Correction Against Computationally Bounded Noise	tcc	online
41	2005	On Error Correction in the Exponent	eprint	online
42	2001	Adaptive Security in the Threshold Setting: From Cryptosystems to Signature Schemes	asiacrypt	331-350