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

Eyal Kushilevitz  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2011	Constant-Rate Oblivious Transfer from Noisy Channels	crypto	664
2	2011	Effcient Non-Interactive Secure Computation	eurocrypt	406
3	2010	Black-Box Constructions of Protocols for Secure Computation	eprint	online
4	2010	Secure Multiparty Computation with Minimal Interaction	crypto	577-594
5	2010	On Achieving the "Best of Both Worlds" in Secure Multiparty Computation	eprint	online
6	2009	Cryptography with Constant Input Locality	jofc	429-469
7	2008	OT-Combiners via Secure Computation	tcc	393-411
8	2007	Public Key Encryption that Allows PIR Queries	eprint	online
9	2007	Cryptography with Constant Input Locality	crypto	92-110
10	2007	Public Key Encryption That Allows PIR Queries	crypto	50-67
11	2007	How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?	crypto	284-302
12	2006	Cryptography from Anonymity	eprint	online
13	2006	On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions	jofc	135-167
14	2006	On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation	crypto	online
15	2005	Sufficient Conditions for Collision-Resistant Hashing	tcc	online
16	2004	On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions	eprint	online
17	2004	On the Hardness of Information-Theoretic Multiparty Computation	eurocrypt	online
18	2003	Efficient Multi-party Computation over Rings	eurocrypt	online
19	2003	On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions	eurocrypt	online
20	2003	Efficient Multi-Party Computation over Rings	eprint	online
21	2002	On 2-Round Secure Multiparty Computation	crypto	online
22	2000	Randomness versus Fault-Tolerance	jofc	107-142
23	2000	Exposure-Resilient Functions and All-or-Nothing Transforms	eurocrypt	453-469
24	2000	One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval	eurocrypt	104-121
25	1998	Improved Cryptanalysis of RC5	eurocrypt	85-99
26	1998	Randomness versus Fault-Tolerance	eprint	online
27	1998	From Differential Cryptoanalysis to Ciphertext-Only Attacks	crypto	72-88
28	1997	Protecting Data Privacy in Private Information Retrieval Schemes	eprint	online
29	1994	On the Structure of the Privacy Hierarchy	jofc	53-60
30	1994	A Randomnesss-Rounds Tradeoff in Private Computation	crypto	397-410
31	1993	A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm	jofc	97-116
32	1993	Secret Sharing Over Infinite Domains	jofc	87-95
33	1989	Secret Sharing Over Infinite Domains (Extended Abstract)	crypto	299-306
34	1988	A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm	crypto	57-70