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

Salil P. Vadhan  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2012	Differential Privacy with Imperfect Randomness	crypto	497-516
2	2012	Randomness Condensers for Efficiently Samplable, Seed-Dependent Sources	tcc	618-635
3	2011	Time-Lock Puzzles in the Random Oracle Model	crypto	39
4	2011	PCPs and the Hardness of Generating Private Synthetic Data	tcc	400
5	2010	Composition of Zero-Knowledge Proofs with Efficient Provers	tcc	572-587
6	2010	Improved Delegation of Computation using Fully Homomorphic Encryption	eprint	online
7	2010	Improved Delegation of Computation Using Fully Homomorphic Encryption	crypto	483-501
8	2010	Universal One-Way Hash Functions via Inaccessible Entropy	eurocrypt	616-637
9	2010	Universal One-Way Hash Functions via Inaccessible Entropy	eprint	online
10	2009	Computational Differential Privacy	crypto	126-142
11	2009	Proofs of Retrievability via Hardness Amplification	eprint	online
12	2009	Fairness with an Honest Minority and a Rational Majority	tcc	36-53
13	2009	Proofs of Retrievability via Hardness Amplification	tcc	109-127
14	2008	An Equivalence Between Zero Knowledge and Commitments	tcc	482-500
15	2008	Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model	tcc	501-534
16	2008	Simpler Session-Key Generation from Short Random Passwords	jofc	52-96
17	2008	Fairness with an Honest Minority and a Rational Majority	eprint	online
18	2007	Amplifying Collision Resistance: A Complexity-Theoretic Treatment	crypto	264-283
19	2007	Zero Knowledge and Soundness Are Symmetric	eurocrypt	187-209
20	2007	Interactive and Noninteractive Zero Knowledge Coincide in the Help Model	eprint	online
21	2007	Interactive and Noninteractive Zero Knowledge are Equivalent in the Help Model	eprint	online
22	2006	Random Selection with an Adversarial Majority	crypto	online
23	2006	Concurrent Zero Knowledge Without Complexity Assumptions	tcc	online
24	2006	Zero Knowledge and Soundness are Symmetric	eprint	online
25	2006	Statistical Zero-Knowledge Arguments for NP from Any One-Way Function	eprint	online
26	2005	Concurrent Zero Knowledge without Complexity Assumptions	eprint	online
27	2005	Derandomization in Cryptography	eprint	online
28	2004	Constructing Locally Computable Extractors and Cryptosystems in the Bounded-Storage Model	jofc	43-77
29	2004	Simpler Session-Key Generation from Short Random Passwords	tcc	428-445
30	2004	Notions of Reducibility between Cryptographic Primitives	tcc	1-20
31	2004	Simpler Session-Key Generation from Short Random Passwords	eprint	online
32	2004	Lower Bounds for Non-Black-Box Zero Knowledge	eprint	online
33	2003	On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model	crypto	online
34	2003	Derandomization in Cryptography	crypto	online
35	2003	Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More	crypto	online
36	2002	An Improved Pseudorandom Generator Based on Hardness of Factoring	eprint	online
37	2002	On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model	eprint	online
38	2001	On the (Im)possibility of Obfuscating Programs	eprint	online
39	2001	On the (Im)possibility of Obfuscating Programs	crypto	1-18
40	2000	A Complete Problem for Statistical Zero Knowledge	eprint	online
41	1999	Can Statistical Zero Knowledge Be Made Non-interactive? or On the Relationship of SZK and NISZK	crypto	467-484
42	1998	Many-to-one Trapdoor Functions and their Relation to Public-key Cryptosystems	eprint	online
43	1998	Comparing Entropies in Statistical Zero-Knowledge with Applications to the Structure of SZK	eprint	online
44	1998	Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems	crypto	283-298