Chris Peikert

International Association for Cryptologic Research

Chris Peikert Search web for home page

Program Committees

1	2017	Eurocrypt	pc
2	2017	TCC	pc
3	2015	PKC	pc
4	2015	TCC	pc
5	2014	TCC	pc
6	2014	Crypto	pc
7	2013	PKC	pc
8	2012	Crypto	pc
9	2011	Eurocrypt	pc
10	2011	TCC	pc
11	2011	Asiacrypt	pc
12	2009	Crypto	pc
13	2008	TCC	pc

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

Chris Peikert Search web for home page

Program Committees

Publications

Coauthors of Chris Peikert