Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Eyal Kushilevitz
2010 – today
- 2013
[j56]Panganamala Ramana Kumar, Eyal Kushilevitz, D. Manjunath, Muriel Médard, Alon Orlitsky, R. Srikant: Guest Editorial: In-Network Computation: Exploring the Fundamental Limits. IEEE Journal on Selected Areas in Communications 31(4): 617-619 (2013)- [c96]Yuval Ishai, Eyal Kushilevitz, Omer Strulovich: Lossy Chains and Fractional Secret Sharing. STACS 2013: 160-171
- [c95]Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky: On the Power of Correlated Randomness in Secure Computation. TCC 2013: 600-620
- [i14]Yuval Ishai, Eyal Kushilevitz, Omer Strulovich: Lossy Chains and Fractional Secret Sharing. IACR Cryptology ePrint Archive 2013: 105 (2013)
- 2012
- [c94]Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Ilan Orlov: Share Conversion and Private Information Retrieval. IEEE Conference on Computational Complexity 2012: 258-268
- [c93]Yuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky: From randomizing polynomials to parallel algorithms. ITCS 2012: 76-89
- [c92]Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky: On the (in)security of hash-based oblivious RAM and a new balancing scheme. SODA 2012: 143-156
- [i13]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: How to Garble Arithmetic Circuits. Electronic Colloquium on Computational Complexity (ECCC) 19: 58 (2012)
- [i12]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: How to Garble Arithmetic Circuits. IACR Cryptology ePrint Archive 2012: 255 (2012)
- [i11]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters: Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits. IACR Cryptology ePrint Archive 2012: 693 (2012)
- 2011
- [j55]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)
- [j54]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)
- [j53]Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition arguments in multiparty communication complexity. Theor. Comput. Sci. 412(24): 2611-2622 (2011)
- [c91]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jürg Wullschleger: Constant-Rate Oblivious Transfer from Noisy Channels. CRYPTO 2011: 667-684
- [c90]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai: Efficient Non-interactive Secure Computation. EUROCRYPT 2011: 406-425
- [c89]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: How to Garble Arithmetic Circuits. FOCS 2011: 120-129
- [i10]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)
- 2010
- [j52]Eyal Kushilevitz, Yehuda Lindell, Tal Rabin: Information-Theoretically Secure Protocols and Security under Composition. SIAM J. Comput. 39(5): 2090-2112 (2010)
- [c88]Yuval Ishai, Eyal Kushilevitz, Anat Paskin: Secure Multiparty Computation with Minimal Interaction. CRYPTO 2010: 577-594
- [c87]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: From Secrecy to Soundness: Efficient Verification via Secure Computation. ICALP (1) 2010: 152-163
- [c86]Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb: Choosing, Agreeing, and Eliminating in Communication Complexity. ICALP (1) 2010: 451-462
- [c85]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? ICS 2010: 1-19
- [c84]
- [i9]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)
- [i8]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)
2000 – 2009
- 2009
- [j51]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography with Constant Input Locality. J. Cryptology 22(4): 429-469 (2009)
- [j50]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Zero-Knowledge Proofs from Secure Multiparty Computation. SIAM J. Comput. 39(3): 1121-1152 (2009)
- [c83]Eyal Kushilevitz, Enav Weinreb: The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. FOCS 2009: 63-72
- [c82]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Extracting Correlations. FOCS 2009: 261-270
- [c81]Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition Arguments in Multiparty Communication Complexity. ICALP (1) 2009: 390-402
- [c80]
- [i7]Jan Draisma, Eyal Kushilevitz, Enav Weinreb: Partition Arguments in Multiparty Communication Complexity. CoRR abs/0909.5684 (2009)
- [i6]Eyal Kushilevitz, Yehuda Lindell, Tal Rabin: Information-Theoretically Secure Protocols and Security Under Composition. IACR Cryptology ePrint Archive 2009: 630 (2009)
- 2008
- [j49]Shirley Halevy, Eyal Kushilevitz: Distribution-Free Connectivity Testing for Sparse Graphs. Algorithmica 51(1): 24-48 (2008)
- [j48]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: On Pseudorandom Generators with Linear Stretch in NC0. Computational Complexity 17(1): 38-69 (2008)
- [j47]Shirley Halevy, Eyal Kushilevitz: Testing monotonicity over graph products. Random Struct. Algorithms 33(1): 44-67 (2008)
- [c79]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Cryptography with constant computational overhead. STOC 2008: 433-442
- [c78]Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen: OT-Combiners via Secure Computation. TCC 2008: 393-411
- [r1]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio: Learning Automata. Encyclopedia of Algorithms 2008
- 2007
- [j46]Shirley Halevy, Eyal Kushilevitz: Distribution-Free Property-Testing. SIAM J. Comput. 37(4): 1107-1138 (2007)
- [c77]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky: Efficient Arguments without Short PCPs. IEEE Conference on Computational Complexity 2007: 278-291
- [c76]Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III: Public Key Encryption That Allows PIR Queries. CRYPTO 2007: 50-67
- [c75]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography with Constant Input Locality. CRYPTO 2007: 92-110
- [c74]Danny Harnik, Yuval Ishai, Eyal Kushilevitz: How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? CRYPTO 2007: 284-302
- [c73]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Zero-knowledge from secure multiparty computation. STOC 2007: 21-30
- [i5]Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III: Public Key Encryption that Allows PIR Queries. IACR Cryptology ePrint Archive 2007: 73 (2007)
- 2006
- [j45]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Computationally Private Randomizing Polynomials and Their Applications. Computational Complexity 15(2): 115-162 (2006)
- [j44]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)
- [j43]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Cryptography in NC0. SIAM J. Comput. 36(4): 845-888 (2006)
- [c72]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: On Pseudorandom Generators with Linear Stretch in NC0. APPROX-RANDOM 2006: 260-271
- [c71]Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. CRYPTO 2006: 483-500
- [c70]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Cryptography from Anonymity. FOCS 2006: 239-248
- [c69]Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank: Black-box constructions for secure computation. STOC 2006: 99-108
- [c68]Eyal Kushilevitz, Yehuda Lindell, Tal Rabin: Information-theoretically secure protocols and security under composition. STOC 2006: 109-118
- [i4]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Cryptography from Anonymity. IACR Cryptology ePrint Archive 2006: 84 (2006)
- 2005
- [j42]Amos Beimel, Yuval Ishai, Eyal Kushilevitz: General constructions for information-theoretic private information retrieval. J. Comput. Syst. Sci. 71(2): 213-247 (2005)
- [j41]Eyal Kushilevitz, Yishay Mansour: Computation in Noisy Radio Networks. SIAM J. Discrete Math. 19(1): 96-108 (2005)
- [c67]Shirley Halevy, Eyal Kushilevitz: A Lower Bound for Distribution-Free Monotonicity Testing. APPROX-RANDOM 2005: 330-341
- [c66]Benny Applebaum, Yuval Ishai, Eyal Kushilevitz: Computationally Private Randomizing Polynomials and Their Applications. IEEE Conference on Computational Complexity 2005: 260-274
- [c65]
- [c64]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky: Sufficient Conditions for Collision-Resistant Hashing. TCC 2005: 445-456
- 2004
- [c63]Shirley Halevy, Eyal Kushilevitz: Distribution-Free Connectivity Testing. APPROX-RANDOM 2004: 393-404
- [c62]Yuval Ishai, Eyal Kushilevitz: On the Hardness of Information-Theoretic Multiparty Computation. EUROCRYPT 2004: 439-455
- [c61]
- [c60]
- [c59]Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai: Batch codes and their applications. STOC 2004: 262-271
- [i3]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
- [j40]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Amortizing Randomness in Private Multiparty Computations. SIAM J. Discrete Math. 16(4): 533-544 (2003)
- [j39]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)
- [c58]Ran Canetti, Eyal Kushilevitz, Yehuda Lindell: On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. EUROCRYPT 2003: 68-86
- [c57]Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz: Efficient Multi-party Computation over Rings. EUROCRYPT 2003: 596-613
- [c56]
- [c55]William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén: Dynamic routing on networks with fixed-size buffers. SODA 2003: 771-780
- [i2]Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz: Efficient Multi-Party Computation over Rings. IACR Cryptology ePrint Archive 2003: 30 (2003)
- 2002
- [j38]Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz: PAC learning with nasty noise. Theor. Comput. Sci. 288(2): 255-275 (2002)
- [c54]Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin: On 2-Round Secure Multiparty Computation. CRYPTO 2002: 178-193
- [c53]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
- [c52]Yuval Ishai, Eyal Kushilevitz: Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. ICALP 2002: 244-256
- [c51]Eyal Kushilevitz: Some Applications of Polynomials for the Design of Cryptographic Protocols. SCN 2002: 1-13
- 2001
- [j37]Amos Beimel, Felix Geller, Eyal Kushilevitz: The Query Complexity of Finding Local Minima in the Lattice. Inf. Comput. 171(1): 69-83 (2001)
- [c50]
- [c49]Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim: Private approximation of NP-hard functions. STOC 2001: 550-559
- [c48]Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin: The round complexity of verifiable secret sharing and secure multicast. STOC 2001: 580-589
- 2000
- [j36]Amos Beimel, Eyal Kushilevitz: Learning unions of high-dimensional boxes over the reals. Inf. Process. Lett. 73(5-6): 213-220 (2000)
- [j35]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio: Learning functions represented as multiplicity automata. J. ACM 47(3): 506-530 (2000)
- [j34]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)
- [j33]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)
- [j32]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Randomness versus Fault-Tolerance. J. Cryptology 13(1): 107-142 (2000)
- [j31]Joe Kilian, Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky: Reducibility and Completeness in Private Computations. SIAM J. Comput. 29(4): 1189-1208 (2000)
- [j30]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. SIAM J. Comput. 30(2): 457-474 (2000)
- [j29]Amos Beimel, Mike Burmester, Yvo Desmedt, Eyal Kushilevitz: Computing Functions of a Shared Secret. SIAM J. Discrete Math. 13(3): 324-345 (2000)
- [c47]Eyal Kushilevitz, Rafail Ostrovsky: One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. EUROCRYPT 2000: 104-121
- [c46]Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai: Exposure-Resilient Functions and All-or-Nothing Transforms. EUROCRYPT 2000: 453-469
- [c45]Yuval Ishai, Eyal Kushilevitz: Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. FOCS 2000: 294-304
1990 – 1999
- 1999
- [j28]Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky: The Linear-Array Conjecture in Communication Complexity Is False. Combinatorica 19(2): 241-254 (1999)
- [j27]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Characterizing Linear Size Circuits in Terms of Pricacy. J. Comput. Syst. Sci. 58(1): 129-136 (1999)
- [c44]
- [c43]Yuval Ishai, Eyal Kushilevitz: Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract). STOC 1999: 79-88
- [c42]Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin: One-Way Functions Are Essential for Single-Server Private Information Retrieval. STOC 1999: 89-98
- 1998
- [j26]
- [j25]Benny Chor, Eyal Kushilevitz, Oded Goldreich, Madhu Sudan: Private Information Retrieval. J. ACM 45(6): 965-981 (1998)
- [j24]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)
- [j23]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)
- [j22]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Log-Space Polynomial End-to-End Communication. SIAM J. Comput. 27(6): 1531-1549 (1998)
- [j21]Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman: Lower Bounds for Randomized Mutual Exclusion. SIAM J. Comput. 27(6): 1550-1563 (1998)
- [j20]Eyal Kushilevitz, Adi Rosén: A Randomness-Rounds Tradeoff in Private Computation. SIAM J. Discrete Math. 11(1): 61-80 (1998)
- [c41]Amos Beimel, Felix Geller, Eyal Kushilevitz: The Query Complexity of Finding Local Minima in the Lattice. COLT 1998: 294-302
- [c40]Alex Biryukov, Eyal Kushilevitz: From Differential Cryptoanalysis to Ciphertext-Only Attacks. CRYPTO 1998: 72-88
- [c39]
- [c38]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Amortizing Randomness in Private Multiparty Computations. PODC 1998: 81-90
- [c37]
- [c36]Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin: Protecting Data Privacy in Private Information Retrieval Schemes. STOC 1998: 151-160
- [c35]William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Adaptive Packet Routing for Bursty Adversarial Traffic. STOC 1998: 359-368
- [c34]Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani: Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. STOC 1998: 614-623
- 1997
- [b1]Eyal Kushilevitz, Noam Nisan: Communication complexity. Cambridge University Press 1997, ISBN 978-0-521-56067-2, pp. I-XIII, 1-189
- [j19]
- [j18]Eyal Kushilevitz: A Simple Algorithm for Learning O (log n)-Term DNF. Inf. Process. Lett. 61(6): 289-292 (1997)
- [j17]Shai Ben-David, Eyal Kushilevitz, Yishay Mansour: Online Learning versus Offline Learning. Machine Learning 29(1): 45-63 (1997)
- [j16]Eyal Kushilevitz, Yishay Mansour: Randomness in Private Computations. SIAM J. Discrete Math. 10(4): 647-661 (1997)
- [c33]
- [c32]Eyal Kushilevitz, Rafail Ostrovsky: Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. FOCS 1997: 364-373
- [c31]Yuval Ishai, Eyal Kushilevitz: Private Simultaneous Messages Protocols with Applications. ISTCS 1997: 174-184
- [c30]Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Randomness vs. Fault-Tolerance. PODC 1997: 35-44
- [c29]Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz: A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. STOC 1997: 324-333
- 1996
- [j15]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)
- [j14]Eyal Kushilevitz, Dan Roth: On Learning Visual Concepts and DNF Formulae. Machine Learning 24(1): 65-85 (1996)
- [c28]
- [c27]Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio: On the Applications of Multiplicity Automata in Learning. FOCS 1996: 349-358
- [c26]
- [c25]Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky: The Linear-Array Conjecture in Communication Complexity is False. STOC 1996: 1-10
- [c24]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Characterizing Linear Size Circuits in Terms of Privacy. STOC 1996: 541-550
- [i1]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)
- 1995
- [j13]Shai Ben-David, Alon Itai, Eyal Kushilevitz: Learning by Distances. Inf. Comput. 117(2): 240-250 (1995)
- [j12]Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz: Private Computations over the Integers. SIAM J. Comput. 24(2): 376-386 (1995)
- [j11]Tomás Feder, Eyal Kushilevitz, Moni Naor, Noam Nisan: Amortized Communication Complexity. SIAM J. Comput. 24(4): 736-750 (1995)
- [j10]Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. SIAM J. Discrete Math. 8(1): 76-92 (1995)
- [j9]Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin: On Lotteries with Unique Winners. SIAM J. Discrete Math. 8(1): 93-98 (1995)
- [c23]
- [c22]Shai Ben-David, Eyal Kushilevitz, Yishay Mansour: Online learning versus offline learning. EuroCOLT 1995: 38-52
- [c21]Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan: Private Information Retrieval. FOCS 1995: 41-50
- [c20]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Log-Space Polynomial End-to-End Communication (Abstract). PODC 1995: 254
- [c19]Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosén: Log-space polynomial end-to-end communication. STOC 1995: 559-568
- 1994
- [j8]Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz: On the Structure of the Privacy Hierarchy. J. Cryptology 7(1): 53-60 (1994)
- [c18]Shai Ben-David, Mauricio Karchmer, Eyal Kushilevitz: On Ultrafilters and NP. Structure in Complexity Theory Conference 1994: 97-105
- [c17]Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth: On Learning Read-k-Satisfy-j DNF. COLT 1994: 110-117
- [c16]Eyal Kushilevitz, Adi Rosén: A Randomnesss-Rounds Tradeoff in Private Computation. CRYPTO 1994: 397-410
- [c15]Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky: Reducibility and Completeness in Multi-Party Private Computations. FOCS 1994: 478-489
- 1993
- [j7]Benny Chor, Eyal Kushilevitz: A Communication-Privacy Tradeoff for Modular Addition. Inf. Process. Lett. 45(4): 205-210 (1993)
- [j6]Benny Chor, Eyal Kushilevitz: Secret Sharing Over Infinite Domains. J. Cryptology 6(2): 87-95 (1993)
- [j5]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)
- [j4]Eyal Kushilevitz, Yishay Mansour: Learning Decision Trees Using the Fourier Spectrum. SIAM J. Comput. 22(6): 1331-1348 (1993)
- [j3]Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz, Alon Orlitsky: Privacy, additional information and communication. IEEE Transactions on Information Theory 39(6): 1930-1943 (1993)
- [c14]
- [c13]Eyal Kushilevitz, Yishay Mansour: An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks. PODC 1993: 65-74
- [c12]Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman: Lower bounds for randomized mutual exclusion. STOC 1993: 154-163
- 1992
- [j2]
- [c11]Mauricio Karchmer, Eyal Kushilevitz, Noam Nisan: Fractional Covers and Communication Complexity. Structure in Complexity Theory Conference 1992: 262-274
- [c10]Eyal Kushilevitz, Michael O. Rabin: Randomized Mutual Exclusion Algorithms Revisited. PODC 1992: 275-283
- 1991
- [j1]Benny Chor, Eyal Kushilevitz: A Zero-One Law for Boolean Privacy. SIAM J. Discrete Math. 4(1): 36-47 (1991)
- [c9]Tomás Feder, Eyal Kushilevitz, Moni Naor: Amortized Communication Complexity (Preliminary Version). FOCS 1991: 239-248
- [c8]Eyal Kushilevitz, Yishay Mansour: Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract). STOC 1991: 455-464
- 1990
- [c7]Reuven Bar-Yehuda, Benny Chor, Eyal Kushilevitz: Privacy, Additional Information, and Communication. Structure in Complexity Theory Conference 1990: 55-65
- [c6]
- [c5]Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz: Private Computations Over the Integers (Extended Abstract). FOCS 1990: 335-344
1980 – 1989
- 1989
- [c4]Benny Chor, Eyal Kushilevitz: Secret Sharing Over Infinite Domains (Extended Abstract). CRYPTO 1989: 299-306
- [c3]
- [c2]Benny Chor, Eyal Kushilevitz: A Zero-One Law for Boolean Privacy (extended abstract). STOC 1989: 62-72
- 1988
- [c1]Oded Goldreich, Eyal Kushilevitz: A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. CRYPTO 1988: 57-70
Coauthor Index
[c96] [c95] [i14] [c94] [c93] [i13] [i12] [i11] [j55] [j54] [c91] [c90] [c89] [c88] [c87] [c85] [i9] [i8] [j51] [j50] [c82] [j48] [c79] [c78] [c77] [c75] [c74] [c73] [j45] [j43] [c72] [c71] [c70] [c69] [i4] [j42] [c66] [c64] [c62] [c61] [c59] [j39] [c57] [i2] [c54] [c53] [c52] [c48] [j33] [c45] [c43] [c42] [c36] [c31]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-14 02:12 CEST by the dblp team