Eyal Kushilevitz

	2012
161		Yuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky: From randomizing polynomials to parallel algorithms. ITCS 2012: 76-89
160		Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky: On the (in)security of hash-based oblivious RAM and a new balancing scheme. SODA 2012: 143-156
159		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: How to Garble Arithmetic Circuits. Electronic Colloquium on Computational Complexity (ECCC) 19: 58 (2012)
	2011
158		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger: Constant-Rate Oblivious Transfer from Noisy Channels. CRYPTO 2011: 667-684
157		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai: Efficient Non-interactive Secure Computation. EUROCRYPT 2011: 406-425
156		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: How to Garble Arithmetic Circuits. FOCS 2011: 120-129
155		Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky: On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme. IACR Cryptology ePrint Archive 2011: 327 (2011)
154		Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. SIAM J. Comput. 40(1): 122-141 (2011)
153		Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-Box Constructions of Protocols for Secure Computation. SIAM J. Comput. 40(2): 225-266 (2011)
152		Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition arguments in multiparty communication complexity. Theor. Comput. Sci. 412(24): 2611-2622 (2011)
	2010
151		Yuval Ishai, Eyal Kushilevitz, Anat Paskin: Secure Multiparty Computation with Minimal Interaction. CRYPTO 2010: 577-594
150		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: From Secrecy to Soundness: Efficient Verification via Secure Computation. ICALP (1) 2010: 152-163
149		Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb: Choosing, Agreeing, and Eliminating in Communication Complexity. ICALP (1) 2010: 451-462
148		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? ICS 2010: 1-19
147		Eyal Kushilevitz: Communication Complexity: From Two-Party to Multiparty. SIROCCO 2010: 1
146		Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-Box Constructions of Protocols for Secure Computation. IACR Cryptology ePrint Archive 2010: 164 (2010)
145		Yuval Ishai, Jonathan Katz, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. IACR Cryptology ePrint Archive 2010: 29 (2010)
144		Eyal Kushilevitz, Yehuda Lindell, Tal Rabin: Information-Theoretically Secure Protocols and Security under Composition. SIAM J. Comput. 39(5): 2090-2112 (2010)
	2009
143		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Extracting Correlations. FOCS 2009: 261-270
142		Eyal Kushilevitz, Enav Weinreb: The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. FOCS 2009: 63-72
141		Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition Arguments in Multiparty Communication Complexity. ICALP (1) 2009: 390-402
140		Eyal Kushilevitz, Enav Weinreb: On the complexity of communication complexity. STOC 2009: 465-474
139		Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition Arguments in Multiparty Communication Complexity CoRR abs/0909.5684: (2009)
138		Eyal Kushilevitz, Yehuda Lindell, Tal Rabin: Information-Theoretically Secure Protocols and Security Under Composition. IACR Cryptology ePrint Archive 2009: 630 (2009)
137		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography with Constant Input Locality. J. Cryptology 22(4): 429-469 (2009)
136		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Zero-Knowledge Proofs from Secure Multiparty Computation. SIAM J. Comput. 39(3): 1121-1152 (2009)
	2008
135		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Cryptography with constant computational overhead. STOC 2008: 433-442
134		Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen: OT-Combiners via Secure Computation. TCC 2008: 393-411
133		Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio: Learning Automata. Encyclopedia of Algorithms 2008
132		Shirley Halevy, Eyal Kushilevitz: Distribution-Free Connectivity Testing for Sparse Graphs. Algorithmica 51(1): 24-48 (2008)
131		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: On Pseudorandom Generators with Linear Stretch in NC0. Computational Complexity 17(1): 38-69 (2008)
130		Shirley Halevy, Eyal Kushilevitz: Testing monotonicity over graph products. Random Struct. Algorithms 33(1): 44-67 (2008)
	2007
129		Danny Harnik, Yuval Ishai, Eyal Kushilevitz: How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? CRYPTO 2007: 284-302
128		Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III: Public Key Encryption That Allows PIR Queries. CRYPTO 2007: 50-67
127		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography with Constant Input Locality. CRYPTO 2007: 92-110
126		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky: Efficient Arguments without Short PCPs. IEEE Conference on Computational Complexity 2007: 278-291
125		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Zero-knowledge from secure multiparty computation. STOC 2007: 21-30
124		Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III: Public Key Encryption that Allows PIR Queries. IACR Cryptology ePrint Archive 2007: 73 (2007)
123		Shirley Halevy, Eyal Kushilevitz: Distribution-Free Property-Testing. SIAM J. Comput. 37(4): 1107-1138 (2007)
	2006
122		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: On Pseudorandom Generators with Linear Stretch in NC0. APPROX-RANDOM 2006: 260-271
121		Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. CRYPTO 2006: 483-500
120		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Cryptography from Anonymity. FOCS 2006: 239-248
119		Eyal Kushilevitz, Yehuda Lindell, Tal Rabin: Information-theoretically secure protocols and security under composition. STOC 2006: 109-118
118		Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-box constructions for secure computation. STOC 2006: 99-108
117		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Computationally Private Randomizing Polynomials and Their Applications. Computational Complexity 15(2): 115-162 (2006)
116		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Cryptography from Anonymity. IACR Cryptology ePrint Archive 2006: 84 (2006)
115		Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. J. Cryptology 19(2): 135-167 (2006)
114		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography in NC0. SIAM J. Comput. 36(4): 845-888 (2006)
	2005
113		Shirley Halevy, Eyal Kushilevitz: A Lower Bound for Distribution-Free Monotonicity Testing. APPROX-RANDOM 2005: 330-341
112		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Computationally Private Randomizing Polynomials and Their Applications. IEEE Conference on Computational Complexity 2005: 260-274
111		Haim Kaplan, Eyal Kushilevitz, Yishay Mansour: Learning with attribute costs. STOC 2005: 356-365
110		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky: Sufficient Conditions for Collision-Resistant Hashing. TCC 2005: 445-456
109		Amos Beimel, Yuval Ishai, Eyal Kushilevitz: General constructions for information-theoretic private information retrieval. J. Comput. Syst. Sci. 71(2): 213-247 (2005)
108		Eyal Kushilevitz, Yishay Mansour: Computation in Noisy Radio Networks. SIAM J. Discrete Math. 19(1): 96-108 (2005)
	2004
107		Shirley Halevy, Eyal Kushilevitz: Distribution-Free Connectivity Testing. APPROX-RANDOM 2004: 393-404
106		Yuval Ishai, Eyal Kushilevitz: On the Hardness of Information-Theoretic Multiparty Computation. EUROCRYPT 2004: 439-455
105		Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography in NC0. FOCS 2004: 166-175
104		Shirley Halevy, Eyal Kushilevitz: Testing Monotonicity over Graph Products. ICALP 2004: 721-732
103		Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Batch codes and their applications. STOC 2004: 262-271
102		Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation Without Set-up Assumptions. IACR Cryptology ePrint Archive 2004: 116 (2004)
	2003
101		Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz: Efficient Multi-party Computation over Rings. EUROCRYPT 2003: 596-613
100		Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. EUROCRYPT 2003: 68-86
99		Shirley Halevy, Eyal Kushilevitz: Distribution-Free Property Testing. RANDOM-APPROX 2003: 302-317
98		William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén: Dynamic routing on networks with fixed-size buffers. SODA 2003: 771-780
97		Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz: Efficient Multi-Party Computation over Rings. IACR Cryptology ePrint Archive 2003: 30 (2003)
96		Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Amortizing Randomness in Private Multiparty Computations. SIAM J. Discrete Math. 16(4): 533-544 (2003)
95		József Balogh, János A. Csirik, Yuval Ishai, Eyal Kushilevitz: Private computation using a PEZ dispenser. Theor. Comput. Sci. 306(1-3): 69-84 (2003)
	2002
94		Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin: On 2-Round Secure Multiparty Computation. CRYPTO 2002: 178-193
93		Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-François Raymond: Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. FOCS 2002: 261-270
92		Yuval Ishai, Eyal Kushilevitz: Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. ICALP 2002: 244-256
91		Eyal Kushilevitz: Some Applications of Polynomials for the Design of Cryptographic Protocols. SCN 2002: 1-13
90		Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz: PAC learning with nasty noise. Theor. Comput. Sci. 288(2): 255-275 (2002)
	2001
89		Eyal Kushilevitz, Tal Rabin: Fair e-Lotteries and e-Casinos. CT-RSA 2001: 100-109
88		Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim: Private approximation of NP-hard functions. STOC 2001: 550-559
87		Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin: The round complexity of verifiable secret sharing and secure multicast. STOC 2001: 580-589
86		Amos Beimel, Felix Geller, Eyal Kushilevitz: The Query Complexity of Finding Local Minima in the Lattice. Inf. Comput. 171(1): 69-83 (2001)
	2000
85		Eyal Kushilevitz, Rafail Ostrovsky: One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. EUROCRYPT 2000: 104-121
84		Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai: Exposure-Resilient Functions and All-or-Nothing Transforms. EUROCRYPT 2000: 453-469
83		Yuval Ishai, Eyal Kushilevitz: Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. FOCS 2000: 294-304
82		Amos Beimel, Eyal Kushilevitz: Learning unions of high-dimensional boxes over the reals. Inf. Process. Lett. 73(5-6): 213-220 (2000)
81		Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio: Learning functions represented as multiplicity automata. J. ACM 47(3): 506-530 (2000)
80		William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Adaptive Packet Routing for Bursty Adversarial Traffic. J. Comput. Syst. Sci. 60(3): 482-509 (2000)
79		Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin: Protecting Data Privacy in Private Information Retrieval Schemes. J. Comput. Syst. Sci. 60(3): 592-629 (2000)
78		Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Randomness versus Fault-Tolerance. J. Cryptology 13(1): 107-142 (2000)
77		Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky: Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000)
76		Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM J. Comput. 30(2): 457-474 (2000)
75		Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz: Computing Functions of a Shared Secret. SIAM J. Discrete Math. 13(3): 324-345 (2000)
	1999
74		Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz: PAC Learning with Nasty Noise. ATL 1999: 206-218
73		Yuval Ishai, Eyal Kushilevitz: Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract). STOC 1999: 79-88
72		Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin: One-Way Functions Are Essential for Single-Server Private Information Retrieval. STOC 1999: 89-98
71		Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky: The Linear-Array Conjecture in Communication Complexity Is False. Combinatorica 19(2): 241-254 (1999)
70		Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Characterizing Linear Size Circuits in Terms of Pricacy. J. Comput. Syst. Sci. 58(1): 129-136 (1999)
	1998
69		Amos Beimel, Felix Geller, Eyal Kushilevitz: The Query Complexity of Finding Local Minima in the Lattice. COLT 1998: 294-302
68		Alex Biryukov, Eyal Kushilevitz: From Differential Cryptoanalysis to Ciphertext-Only Attacks. CRYPTO 1998: 72-88
67		Alex Biryukov, Eyal Kushilevitz: Improved Cryptanalysis of RC5. EUROCRYPT 1998: 85-99
66		Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Amortizing Randomness in Private Multiparty Computations. PODC 1998: 81-90
65		Eyal Kushilevitz, Yishay Mansour: Computation in Noisy Radio Networks. SODA 1998: 236-243
64		Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin: Protecting Data Privacy in Private Information Retrieval Schemes. STOC 1998: 151-160
63		William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Adaptive Packet Routing for Bursty Adversarial Traffic. STOC 1998: 359-368
62		Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. STOC 1998: 614-623
61		Amos Beimel, Eyal Kushilevitz: Learning Boxes in High Dimension. Algorithmica 22(1/2): 76-90 (1998)
60		Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan: Private Information Retrieval. J. ACM 45(6): 965-981 (1998)
59		Eyal Kushilevitz, Yishay Mansour: An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks. SIAM J. Comput. 27(3): 702-712 (1998)
58		Howard Aizenstein, Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth: On Learning Read-k-Satisfy-j DNF. SIAM J. Comput. 27(6): 1515-1530 (1998)
57		Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Log-Space Polynomial End-to-End Communication. SIAM J. Comput. 27(6): 1531-1549 (1998)
56		Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman: Lower Bounds for Randomized Mutual Exclusion. SIAM J. Comput. 27(6): 1550-1563 (1998)
55		Eyal Kushilevitz, Adi Rosén: A Randomness-Rounds Tradeoff in Private Computation. SIAM J. Discrete Math. 11(1): 61-80 (1998)
	1997
54		Eyal Kushilevitz, Noam Nisan: Communication complexity. Cambridge University Press 1997: I-XIII, 1-189
53		Amos Beimel, Eyal Kushilevitz: Learning Boxes in High Dimension. EuroCOLT 1997: 3-15
52		Eyal Kushilevitz, Rafail Ostrovsky: Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. FOCS 1997: 364-373
51		Yuval Ishai, Eyal Kushilevitz: Private Simultaneous Messages Protocols with Applications. ISTCS 1997: 174-184
50		Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Randomness vs. Fault-Tolerance. PODC 1997: 35-44
49		Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz: A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. STOC 1997: 324-333
48		Eyal Kushilevitz: Communication Complexity. Advances in Computers 44: 331-360 (1997)
47		Eyal Kushilevitz: A Simple Algorithm for Learning O (log n)-Term DNF. Inf. Process. Lett. 61(6): 289-292 (1997)
46		Shai Ben-David, Eyal Kushilevitz, Yishay Mansour: Online Learning versus Offline Learning. Machine Learning 29(1): 45-63 (1997)
45		Eyal Kushilevitz, Yishay Mansour: Randomness in Private Computations. SIAM J. Discrete Math. 10(4): 647-661 (1997)
	1996
44		Eyal Kushilevitz: A Simple Algorithm for Learning O(log n)-Term DNF. COLT 1996: 266-269
43		Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio: On the Applications of Multiplicity Automata in Learning. FOCS 1996: 349-358
42		Eyal Kushilevitz, Yishay Mansour: Randomness in Private Computations. PODC 1996: 181-190
41		Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky: The Linear-Array Conjecture in Communication Complexity is False. STOC 1996: 1-10
40		Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Characterizing Linear Size Circuits in Terms of Privacy. STOC 1996: 541-550
39		Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz: A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes Electronic Colloquium on Computational Complexity (ECCC) 3(59): (1996)
38		Eyal Kushilevitz, Nathan Linial, Yuri Rabinovich, Michael E. Saks: Witness Sets for Families of Binary Vectors. J. Comb. Theory, Ser. A 73(2): 376-380 (1996)
37		Eyal Kushilevitz, Dan Roth: On Learning Visual Concepts and DNF Formulae. Machine Learning 24(1): 65-85 (1996)
	1995
36		Shai Ben-David, Nadav Eiron, Eyal Kushilevitz: On Self-Directed Learning. COLT 1995: 136-143
35		Shai Ben-David, Eyal Kushilevitz, Yishay Mansour: Online learning versus offline learning. EuroCOLT 1995: 38-52
34		Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan: Private Information Retrieval. FOCS 1995: 41-50
33		Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Log-Space Polynomial End-to-End Communication (Abstract). PODC 1995: 254
32		Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Log-space polynomial end-to-end communication. STOC 1995: 559-568
31		Shai Ben-David, Alon Itai, Eyal Kushilevitz: Learning by Distances Inf. Comput. 117(2): 240-250 (1995)
30		Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz: Private Computations over the Integers. SIAM J. Comput. 24(2): 376-386 (1995)
29		Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan: Amortized Communication Complexity. SIAM J. Comput. 24(4): 736-750 (1995)
28		Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. SIAM J. Discrete Math. 8(1): 76-92 (1995)
27		Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin: On Lotteries with Unique Winners. SIAM J. Discrete Math. 8(1): 93-98 (1995)
	1994
26		Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth: On Learning Read-k-Satisfy-j DNF. COLT 1994: 110-117
25		Eyal Kushilevitz, Adi Rosén: A Randomnesss-Rounds Tradeoff in Private Computation. CRYPTO 1994: 397-410
24		Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky: Reducibility and Completeness in Multi-Party Private Computations FOCS 1994: 478-489
23		Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz: On Ultrafilters and NP. Structure in Complexity Theory Conference 1994: 97-105
22		Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz: On the Structure of the Privacy Hierarchy. J. Cryptology 7(1): 53-60 (1994)
	1993
21		Eyal Kushilevitz, Dan Roth: On Learning Visual Concepts and DNF Formulae. COLT 1993: 317-326
20		Eyal Kushilevitz, Yishay Mansour: An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks. PODC 1993: 65-74
19		Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman: Lower bounds for randomized mutual exclusion. STOC 1993: 154-163
18		Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky: Privacy, additional information and communication. IEEE Transactions on Information Theory 39(6): 1930-1943 (1993)
17		Benny Chor, Eyal Kushilevitz: A Communication-Privacy Tradeoff for Modular Addition. Inf. Process. Lett. 45(4): 205-210 (1993)
16		Benny Chor, Eyal Kushilevitz: Secret Sharing Over Infinite Domains. J. Cryptology 6(2): 87-95 (1993)
15		Oded Goldreich, Eyal Kushilevitz: A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm. J. Cryptology 6(2): 97-116 (1993)
14		Eyal Kushilevitz, Yishay Mansour: Learning Decision Trees Using the Fourier Spectrum. SIAM J. Comput. 22(6): 1331-1348 (1993)
	1992
13		Eyal Kushilevitz, Michael O. Rabin: Randomized Mutual Exclusion Algorithms Revisited. PODC 1992: 275-283
12		Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. Structure in Complexity Theory Conference 1992: 262-274
11		Eyal Kushilevitz: Privacy and Communication Complexity. SIAM J. Discrete Math. 5(2): 273-284 (1992)
	1991
10		Tomás Feder, Eyal Kushilevitz, Moni Naor: Amortized Communication Complexity (Preliminary Version) FOCS 1991: 239-248
9		Eyal Kushilevitz, Yishay Mansour: Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract) STOC 1991: 455-464
8		Benny Chor, Eyal Kushilevitz: A Zero-One Law for Boolean Privacy. SIAM J. Discrete Math. 4(1): 36-47 (1991)
	1990
7		Shai Ben-David, Alon Itai, Eyal Kushilevitz: Learning by Distances. COLT 1990: 232-245
6		Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz: Private Computations Over the Integers (Extended Abstract) FOCS 1990: 335-344
5		Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz: Privacy, Additional Information, and Communication. Structure in Complexity Theory Conference 1990: 55-65
	1989
4		Benny Chor, Eyal Kushilevitz: Secret Sharing Over Infinite Domains (Extended Abstract). CRYPTO 1989: 299-306
3		Eyal Kushilevitz: Privacy and Communication Complexity FOCS 1989: 416-421
2		Benny Chor, Eyal Kushilevitz: A Zero-One Law for Boolean Privacy (extended abstract) STOC 1989: 62-72
	1988
1		Oded Goldreich, Eyal Kushilevitz: A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. CRYPTO 1988: 57-70

Coauthor Index

1	William Aiello	[63] [80] [98]
2	Howard Aizenstein	[58]
3	Benny Applebaum	[105] [112] [114] [117] [122] [127] [131] [137] [148] [150] [156] [159]
4	József Balogh	[95]
5	Reuven Bar-Yehuda	[5] [18]
6	Amos Beimel	[43] [53] [61] [69] [72] [75] [81] [82] [86] [93] [109] [133] [149]
7	Shai Ben-David	[7] [23] [31] [35] [36] [39] [46] [49]
8	Francesco Bergadano	[43] [81] [133]
9	Alex Biryukov	[67] [68]
10	Avrim Blum	[26] [58]
11	Dan Boneh	[124] [128]
12	Nader H. Bshouty	[39] [43] [49] [74] [81] [90] [133]
13	Mike Burmester	[75]
14	Ran Canetti	[50] [78] [84] [100] [102] [115]
15	Benny Chor	[2] [4] [5] [6] [8] [16] [17] [18] [22] [30] [34] [60]
16	Ronald Cramer	[97] [101]
17	János A. Csirik	[95]
18	Sebastian Ben Daniel	[149]
19	Yvo Desmedt	[75]
20	Yevgeniy Dodis	[84]
21	Jan Draisma	[139] [141] [152]
22	Nadav Eiron	[36] [74] [90]
23	Tomás Feder	[10] [29]
24	Serge Fehr	[97] [101]
25	Felix Geller	[69] [86]
26	Rosario Gennaro	[87] [94]
27	Mihály Geréb-Graus	[6] [22] [30]
28	Yael Gertner	[64] [79]
29	Oded Goldreich	[1] [15] [34] [60]
30	Iftach Haitner	[146] [153]
31	Shai Halevi	[84] [88]
32	Shirley Halevy	[99] [104] [107] [113] [123] [130] [132]
33	Danny Harnik	[129] [134]
34	Yuval Ishai	[51] [64] [72] [73] [79] [83] [87] [92] [93] [94] [95] [97] [101] [103] [105] [106] [109] [110] [112] [114] [116] [117] [118] [120] [121] [122] [125] [126] [127] [129] [131] [134] [135] [136] [137] [143] [145] [146] [148] [150] [151] [153] [154] [156] [157] [158] [159] [161]
35	Alon Itai	[7] [31]
36	Haim Kaplan	[111]
37	Mauricio Karchmer	[12] [23] [28]
38	Jonathan Katz	[145] [154]
39	Roni Khardon	[26] [58]
40	Joe Kilian	[77]
41	Robert Krauthgamer	[88]
42	Yehuda Lindell	[100] [102] [115] [118] [119] [121] [138] [144] [145] [146] [153] [154]
43	Nathan Linial (Nati Linial)	[38] [41] [71]
44	Steve Lu	[155] [160]
45	Tal Malkin	[64] [72] [79]
46	Yishay Mansour	[9] [14] [19] [20] [27] [35] [42] [45] [46] [56] [59] [65] [108] [111]
47	Silvio Micali	[24] [77]
48	Moni Naor	[10] [29]
49	Jesper Buus Nielsen	[134]
50	Noam Nisan	[12] [28] [29] [54]
51	Kobbi Nissim	[88]
52	Alon Orlitsky	[18]
53	Rafail Ostrovsky	[24] [32] [33] [40] [41] [50] [52] [57] [62] [63] [66] [70] [71] [76] [77] [78] [80] [85] [96] [98] [103] [110] [116] [120] [124] [125] [126] [128] [135] [136] [143] [155] [157] [158] [160]
54	Anat Paskin-Cherniavsky (Anat Paskin)	[151] [161]
55	Erez Petrank	[118] [121] [145] [146] [153] [154]
56	Leonard Pitt	[26] [58]
57	Manoj Prabhakaran	[157] [158]
58	Yuval Rabani	[62] [76]
59	Michael O. Rabin	[13] [19] [27] [56]
60	Tal Rabin	[87] [89] [94] [119] [138] [144]
61	Yuri Rabinovich	[38]
62	Jean-François Raymond	[93]
63	Adi Rosén	[25] [32] [33] [40] [50] [55] [57] [63] [66] [70] [78] [80] [96] [98]
64	Dan Roth	[21] [26] [37] [58]
65	Amit Sahai	[84] [103] [116] [120] [125] [135] [136] [143] [157] [158]
66	Michael E. Saks (Michael Saks)	[38]
67	William E. Skeith III	[124] [128]
68	Madhu Sudan	[34] [60]
69	Stefano Varricchio	[43] [81] [133]
70	Enav Weinreb	[139] [140] [141] [142] [149] [152]
71	Jürg Wullschleger	[158]
72	David Zuckerman	[19] [56]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page