| 2025 | EuroCrypt | Query-Reusable Proof Systems. | Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Rafail Ostrovsky, Akash Shah |
| 2025 | TCC | Cryptography with Weak Privacy. | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Hanjun Li |
| 2023 | CRYPTO | Perfect MPC over Layered Graphs. | Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, Varun Narayanan |
| 2023 | CRYPTO | Additive Randomized Encodings and Their Applications. | Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Tal Rabin |
| 2023 | STOC | Succinct Computational Secret Sharing. | Benny Applebaum, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tianren Liu, Vinod Vaikuntanathan |
| 2023 | STOC | Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness. | Riddhi Ghosal, Yuval Ishai, Alexis Korb, Eyal Kushilevitz, Paul Lou, Amit Sahai |
| 2023 | TCC | Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. | Damiano Abram, Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan |
| 2023 | TCC | Anonymous Permutation Routing. | Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky |
| 2022 | PKC | CNF-FSS and Its Applications. | Paul Bunn, Eyal Kushilevitz, Rafail Ostrovsky |
| 2022 | TCC | Random-Index Oblivious RAM. | Shai Halevi, Eyal Kushilevitz |
| 2021 | CRYPTO | Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration. | Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen |
| 2020 | ASIACRYPT | Cryptography from One-Way Communication: On Completeness of Finite Channels. | Shweta Agrawal, Yuval Ishai, Eyal Kushilevitz, Varun Narayanan, Manoj Prabhakaran, Vinod M. Prabhakaran, Alon Rosen |
| 2020 | SCN | Efficient 3-Party Distributed ORAM. | Paul Bunn, Jonathan Katz, Eyal Kushilevitz, Rafail Ostrovsky |
| 2019 | CRYPTO | Cryptographic Sensing. | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
| 2019 | PKC | Sub-logarithmic Distributed Oblivious RAM with Small Block Size. | Eyal Kushilevitz, Tamer Mour |
| 2019 | TCC | On Fully Secure MPC with Solitary Output. | Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Nikolaos Makriyannis, Tal Rabin |
| 2019 | TCC | Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. | Eyal Kushilevitz, Rafail Ostrovsky, Emmanuel Prouff, Adi Rosn, Adrian Thillard, Damien Vergnaud |
| 2018 | EuroCrypt | The Complexity of Multiparty PSM Protocols and Related Models. | Amos Beimel, Eyal Kushilevitz, Pnina Nissim |
| 2018 | TCC | Best Possible Information-Theoretic MPC. | Shai Halevi, Yuval Ishai, Eyal Kushilevitz, Tal Rabin |
| 2017 | EuroCrypt | Ad Hoc PSM Protocols: Secure Computation Without Coordination. | Amos Beimel, Yuval Ishai, Eyal Kushilevitz |
| 2016 | CRYPTO | Secure Protocol Transformations. | Yuval Ishai, Eyal Kushilevitz, Manoj Prabhakaran, Amit Sahai, Ching-Hua Yu |
| 2015 | CRYPTO | Cryptography with One-Way Communication. | Sanjam Garg, Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
| 2015 | CRYPTO | Secure Computation with Minimal Interaction, Revisited. | Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz, Anat Paskin-Cherniavsky |
| 2014 | CRYPTO | Non-Interactive Secure Multiparty Computation. | Amos Beimel, Ariel Gabizon, Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Anat Paskin-Cherniavsky |
| 2014 | TCC | On the Cryptographic Complexity of the Worst Functions. | Amos Beimel, Yuval Ishai, Ranjit Kumaresan, Eyal Kushilevitz |
| 2013 | CRYPTO | Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys. | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz, Brent Waters |
| 2013 | ICALP | Robust Pseudorandom Generators. | Yuval Ishai, Eyal Kushilevitz, Xin Li, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, David Zuckerman |
| 2013 | STACS | Lossy Chains and Fractional Secret Sharing. | Yuval Ishai, Eyal Kushilevitz, Omer Strulovich |
| 2013 | TCC | On the Power of Correlated Randomness in Secure Computation. | Yuval Ishai, Eyal Kushilevitz, Sigurd Meldgaard, Claudio Orlandi, Anat Paskin-Cherniavsky |
| 2012 | SODA | On the (in)security of hash-based oblivious RAM and a new balancing scheme. | Eyal Kushilevitz, Steve Lu, Rafail Ostrovsky |
| 2011 | CRYPTO | Constant-Rate Oblivious Transfer from Noisy Channels. | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai, Jrg Wullschleger |
| 2011 | EuroCrypt | Efficient Non-interactive Secure Computation. | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Manoj Prabhakaran, Amit Sahai |
| 2011 | FOCS | How to Garble Arithmetic Circuits. | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
| 2010 | CRYPTO | Secure Multiparty Computation with Minimal Interaction. | Yuval Ishai, Eyal Kushilevitz, Anat Paskin |
| 2010 | ICALP | From Secrecy to Soundness: Efficient Verification via Secure Computation. | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
| 2010 | ICALP | Choosing, Agreeing, and Eliminating in Communication Complexity. | Amos Beimel, Sebastian Ben Daniel, Eyal Kushilevitz, Enav Weinreb |
| 2010 | SIROCCO | Communication Complexity: From Two-Party to Multiparty. | Eyal Kushilevitz |
| 2009 | FOCS | Extracting Correlations. | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
| 2009 | FOCS | The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. | Eyal Kushilevitz, Enav Weinreb |
| 2009 | ICALP | Partition Arguments in Multiparty Communication Complexity. | Jan Draisma, Eyal Kushilevitz, Enav Weinreb |
| 2009 | STOC | On the complexity of communication complexity. | Eyal Kushilevitz, Enav Weinreb |
| 2008 | STOC | Cryptography with constant computational overhead. | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
| 2008 | TCC | OT-Combiners via Secure Computation. | Danny Harnik, Yuval Ishai, Eyal Kushilevitz, Jesper Buus Nielsen |
| 2007 | CRYPTO | Cryptography with Constant Input Locality. | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
| 2007 | CRYPTO | Public Key Encryption That Allows PIR Queries. | Dan Boneh, Eyal Kushilevitz, Rafail Ostrovsky, William E. Skeith III |
| 2007 | CRYPTO | How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? | Danny Harnik, Yuval Ishai, Eyal Kushilevitz |
| 2007 | STOC | Zero-knowledge from secure multiparty computation. | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
| 2006 | CRYPTO | On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
| 2006 | FOCS | Cryptography from Anonymity. | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
| 2006 | STOC | Black-box constructions for secure computation. | Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Erez Petrank |
| 2006 | STOC | Information-theoretically secure protocols and security under composition. | Eyal Kushilevitz, Yehuda Lindell, Tal Rabin |
| 2005 | STOC | Learning with attribute costs. | Haim Kaplan, Eyal Kushilevitz, Yishay Mansour |
| 2005 | TCC | Sufficient Conditions for Collision-Resistant Hashing. | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky |
| 2004 | EuroCrypt | On the Hardness of Information-Theoretic Multiparty Computation. | Yuval Ishai, Eyal Kushilevitz |
| 2004 | FOCS | Cryptography in NC | Benny Applebaum, Yuval Ishai, Eyal Kushilevitz |
| 2004 | ICALP | Testing Monotonicity over Graph Products. | Shirley Halevy, Eyal Kushilevitz |
| 2004 | STOC | Batch codes and their applications. | Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, Amit Sahai |
| 2003 | EuroCrypt | On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. | Ran Canetti, Eyal Kushilevitz, Yehuda Lindell |
| 2003 | EuroCrypt | Efficient Multi-party Computation over Rings. | Ronald Cramer, Serge Fehr, Yuval Ishai, Eyal Kushilevitz |
| 2003 | SODA | Dynamic routing on networks with fixed-size buffers. | William Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosn |
| 2002 | CRYPTO | On 2-Round Secure Multiparty Computation. | Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin |
| 2002 | FOCS | Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Jean-Franois Raymond |
| 2002 | ICALP | Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. | Yuval Ishai, Eyal Kushilevitz |
| 2002 | SCN | Some Applications of Polynomials for the Design of Cryptographic Protocols. | Eyal Kushilevitz |
| 2001 | STOC | The round complexity of verifiable secret sharing and secure multicast. | Rosario Gennaro, Yuval Ishai, Eyal Kushilevitz, Tal Rabin |
| 2001 | STOC | Private approximation of NP-hard functions. | Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz, Kobbi Nissim |
| 2000 | EuroCrypt | Exposure-Resilient Functions and All-or-Nothing Transforms. | Ran Canetti, Yevgeniy Dodis, Shai Halevi, Eyal Kushilevitz, Amit Sahai |
| 2000 | EuroCrypt | One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. | Eyal Kushilevitz, Rafail Ostrovsky |
| 2000 | FOCS | Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. | Yuval Ishai, Eyal Kushilevitz |
| 1999 | ALT | PAC Learning with Nasty Noise. | Nader H. Bshouty, Nadav Eiron, Eyal Kushilevitz |
| 1999 | STOC | One-Way Functions Are Essential for Single-Server Private Information Retrieval. | Amos Beimel, Yuval Ishai, Eyal Kushilevitz, Tal Malkin |
| 1999 | STOC | Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract). | Yuval Ishai, Eyal Kushilevitz |
| 1998 | COLT | The Query Complexity of Finding Local Minima in the Lattice. | Amos Beimel, Felix Geller, Eyal Kushilevitz |
| 1998 | CRYPTO | From Differential Cryptanalysis to Ciphertext-Only Attacks. | Alex Biryukov, Eyal Kushilevitz |
| 1998 | EuroCrypt | Improved Cryptanalysis of RC5. | Alex Biryukov, Eyal Kushilevitz |
| 1998 | PODC | Amortizing Randomness in Private Multiparty Computations. | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1998 | SODA | Computation in Noisy Radio Networks. | Eyal Kushilevitz, Yishay Mansour |
| 1998 | STOC | Adaptive Packet Routing for Bursty Adversarial Traffic. | William Aiello, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1998 | STOC | Protecting Data Privacy in Private Information Retrieval Schemes. | Yael Gertner, Yuval Ishai, Eyal Kushilevitz, Tal Malkin |
| 1998 | STOC | Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. | Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani |
| 1997 | FOCS | Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. | Eyal Kushilevitz, Rafail Ostrovsky |
| 1997 | PODC | Randomness vs. Fault-Tolerance. | Ran Canetti, Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1997 | STOC | A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. | Shai Ben-David, Nader H. Bshouty, Eyal Kushilevitz |
| 1996 | COLT | A Simple Algorithm for Learning O(log n)-Term DNF. | Eyal Kushilevitz |
| 1996 | FOCS | On the Applications of Multiplicity Automata in Learning. | Amos Beimel, Francesco Bergadano, Nader H. Bshouty, Eyal Kushilevitz, Stefano Varricchio |
| 1996 | PODC | Randomness in Private Computations. | Eyal Kushilevitz, Yishay Mansour |
| 1996 | STOC | The Linear-Array Conjecture in Communication Complexity is False. | Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky |
| 1996 | STOC | Characterizing Linear Size Circuits in Terms of Privacy. | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1995 | COLT | On Self-Directed Learning. | Shai Ben-David, Nadav Eiron, Eyal Kushilevitz |
| 1995 | FOCS | Private Information Retrieval. | Benny Chor, Oded Goldreich, Eyal Kushilevitz, Madhu Sudan |
| 1995 | PODC | Log-Space Polynomial End-to-End Communication (Abstract). | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1995 | STOC | Log-space polynomial end-to-end communication. | Eyal Kushilevitz, Rafail Ostrovsky, Adi Rosn |
| 1994 | COLT | On Learning Read- | Avrim Blum, Roni Khardon, Eyal Kushilevitz, Leonard Pitt, Dan Roth |
| 1994 | CRYPTO | A Randomnesss-Rounds Tradeoff in Private Computation. | Eyal Kushilevitz, Adi Rosn |
| 1994 | FOCS | Reducibility and Completeness in Multi-Party Private Computations | Eyal Kushilevitz, Silvio Micali, Rafail Ostrovsky |
| 1993 | COLT | On Learning Visual Concepts and DNF Formulae. | Eyal Kushilevitz, Dan Roth |
| 1993 | PODC | An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks. | Eyal Kushilevitz, Yishay Mansour |
| 1993 | STOC | Lower bounds for randomized mutual exclusion. | Eyal Kushilevitz, Yishay Mansour, Michael O. Rabin, David Zuckerman |
| 1992 | PODC | Randomized Mutual Exclusion Algorithms Revisited. | Eyal Kushilevitz, Michael O. Rabin |
| 1991 | FOCS | Amortized Communication Complexity (Preliminary Version) | Toms Feder, Eyal Kushilevitz, Moni Naor |
| 1991 | STOC | Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract) | Eyal Kushilevitz, Yishay Mansour |
| 1990 | COLT | Learning by Distances. | Shai Ben-David, Alon Itai, Eyal Kushilevitz |
| 1990 | FOCS | Private Computations Over the Integers (Extended Abstract) | Benny Chor, Mihly Gerb-Graus, Eyal Kushilevitz |
| 1989 | CRYPTO | Secret Sharing Over Infinite Domains (Extended Abstract). | Benny Chor, Eyal Kushilevitz |
| 1989 | FOCS | Privacy and Communication Complexity | Eyal Kushilevitz |
| 1989 | STOC | A Zero-One Law for Boolean Privacy (extended abstract) | Benny Chor, Eyal Kushilevitz |
| 1988 | CRYPTO | A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. | Oded Goldreich, Eyal Kushilevitz |