A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. - Oded Goldreich 001; Eyal Kushilevitz (CRYPTO, 1988)

Secret Sharing Over Infinite Domains (Extended Abstract). - Benny Chor; Eyal Kushilevitz (CRYPTO, 1989)

Privacy and Communication Complexity - Eyal Kushilevitz (FOCS, 1989)

A Zero-One Law for Boolean Privacy (extended abstract) - Benny Chor; Eyal Kushilevitz (STOC, 1989)

Privacy, Additional Information, and Communication. - Reuven Bar-Yehuda; Benny Chor; Eyal Kushilevitz (SCT, 1990)

Learning by Distances. - Shai Ben-David; Alon Itai; Eyal Kushilevitz (COLT, 1990)

Private Computations Over the Integers (Extended Abstract) - Benny Chor; Mihály Geréb-Graus; Eyal Kushilevitz (FOCS, 1990)

Amortized Communication Complexity (Preliminary Version) - Tomás Feder; Eyal Kushilevitz; Moni Naor (FOCS, 1991)

Learning Decision Trees Using the Fourier Sprectrum (Extended Abstract) - Eyal Kushilevitz; Yishay Mansour (STOC, 1991)

A Zero-One Law for Boolean Privacy. - Benny Chor; Eyal Kushilevitz (SIAM J. Discret. Math., 1991)

Fractional Covers and Communication Complexity. - Mauricio Karchmer; Eyal Kushilevitz; Noam Nisan (SCT, 1992)

Randomized Mutual Exclusion Algorithms Revisited. - Eyal Kushilevitz; Michael O. Rabin (PODC, 1992)

On Learning Visual Concepts and DNF Formulae. - Eyal Kushilevitz; Dan Roth 001 (COLT, 1993)

An Omega(D log(N/D)) Lower Bound for Broadcast in Radio Networks. - Eyal Kushilevitz; Yishay Mansour (PODC, 1993)

Lower bounds for randomized mutual exclusion. - Eyal Kushilevitz; Yishay Mansour; Michael O. Rabin; David Zuckerman (STOC, 1993)

A Communication-Privacy Tradeoff for Modular Addition. - Benny Chor; Eyal Kushilevitz (Inf. Process. Lett., 1993)

Secret Sharing Over Infinite Domains. - Benny Chor; Eyal Kushilevitz (J. Cryptol., 1993)

A Perfect Zero-Knowledge Proof System for a Problem Equivalent to the Discrete Logarithm. - Oded Goldreich 001; Eyal Kushilevitz (J. Cryptol., 1993)

Learning Decision Trees Using the Fourier Spectrum. - Eyal Kushilevitz; Yishay Mansour (SIAM J. Comput., 1993)

Privacy, additional information and communication. - Reuven Bar-Yehuda; Benny Chor; Eyal Kushilevitz; Alon Orlitsky (IEEE Trans. Inf. Theory, 1993)

On Ultrafilters and NP. - Shai Ben-David; Mauricio Karchmer; Eyal Kushilevitz (SCT, 1994)

On Learning Read-k-Satisfy-j DNF. - Avrim Blum; Roni Khardon; Eyal Kushilevitz; Leonard Pitt; Dan Roth 001 (COLT, 1994)

A Randomnesss-Rounds Tradeoff in Private Computation. - Eyal Kushilevitz; Adi Rosén (CRYPTO, 1994)

Reducibility and Completeness in Multi-Party Private Computations - Eyal Kushilevitz; Silvio Micali; Rafail Ostrovsky (FOCS, 1994)

On the Structure of the Privacy Hierarchy. - Benny Chor; Mihály Geréb-Graus; Eyal Kushilevitz (J. Cryptol., 1994)

On Self-Directed Learning. - Shai Ben-David; Nadav Eiron; Eyal Kushilevitz (COLT, 1995)

Online learning versus offline learning. - Shai Ben-David; Eyal Kushilevitz; Yishay Mansour (EuroCOLT, 1995)

Private Information Retrieval. - Benny Chor; Oded Goldreich 001; Eyal Kushilevitz; Madhu Sudan 001 (FOCS, 1995)

Log-Space Polynomial End-to-End Communication (Abstract). - Eyal Kushilevitz; Rafail Ostrovsky; Adi Rosén (PODC, 1995)

Log-space polynomial end-to-end communication. - Eyal Kushilevitz; Rafail Ostrovsky; Adi Rosén (STOC, 1995)

Private Computations over the Integers. - Benny Chor; Mihály Geréb-Graus; Eyal Kushilevitz (SIAM J. Comput., 1995)

Amortized Communication Complexity. - Tomás Feder; Eyal Kushilevitz; Moni Naor; Noam Nisan (SIAM J. Comput., 1995)

On Lotteries with Unique Winners. - Eyal Kushilevitz; Yishay Mansour; Michael O. Rabin (SIAM J. Discret. Math., 1995)

A Simple Algorithm for Learning O(log n)-Term DNF. - Eyal Kushilevitz (COLT, 1996)

On the Applications of Multiplicity Automata in Learning. - Amos Beimel; Francesco Bergadano; Nader H. Bshouty; Eyal Kushilevitz; Stefano Varricchio (FOCS, 1996)

Randomness in Private Computations. - Eyal Kushilevitz; Yishay Mansour (PODC, 1996)

The Linear-Array Conjecture in Communication Complexity is False. - Eyal Kushilevitz; Nathan Linial; Rafail Ostrovsky (STOC, 1996)

Characterizing Linear Size Circuits in Terms of Privacy. - Eyal Kushilevitz; Rafail Ostrovsky; Adi Rosén (STOC, 1996)

Witness Sets for Families of Binary Vectors. - Eyal Kushilevitz; Nathan Linial; Yuri Rabinovich; Michael E. Saks (J. Comb. Theory A, 1996)

Communication complexity. - Eyal Kushilevitz; Noam Nisan (Cambridge University Press, 1997)

Learning Boxes in High Dimension. - Amos Beimel; Eyal Kushilevitz (EuroCOLT, 1997)

Replication is NOT Needed: SINGLE Database, Computationally-Private Information Retrieval. - Eyal Kushilevitz; Rafail Ostrovsky (FOCS, 1997)

Private Simultaneous Messages Protocols with Applications. - Yuval Ishai; Eyal Kushilevitz (ISTCS, 1997)

Randomness vs. Fault-Tolerance. - Ran Canetti; Eyal Kushilevitz; Rafail Ostrovsky; Adi Rosén (PODC, 1997)

A Composition Theorem for Learning Algorithms with Applications to Geometric Concept Classes. - Shai Ben-David; Nader H. Bshouty; Eyal Kushilevitz (STOC, 1997)

Communication Complexity. - Eyal Kushilevitz (Adv. Comput., 1997)

Protecting Data Privacy in Private Information Retrieval Schemes. - Yuval Ishai; Eyal Kushilevitz (IACR Cryptol. ePrint Arch., 1997)

The Query Complexity of Finding Local Minima in the Lattice. - Amos Beimel; Felix Geller; Eyal Kushilevitz (COLT, 1998)

From Differential Cryptanalysis to Ciphertext-Only Attacks. - Alex Biryukov; Eyal Kushilevitz (CRYPTO, 1998)

Improved Cryptanalysis of RC5. - Alex Biryukov; Eyal Kushilevitz (EUROCRYPT, 1998)

Amortizing Randomness in Private Multiparty Computations. - Eyal Kushilevitz; Rafail Ostrovsky; Adi Rosén (PODC, 1998)

Computation in Noisy Radio Networks. - Eyal Kushilevitz; Yishay Mansour (SODA, 1998)

Adaptive Packet Routing for Bursty Adversarial Traffic. - William Aiello; Eyal Kushilevitz; Rafail Ostrovsky; Adi Rosén (STOC, 1998)

Protecting Data Privacy in Private Information Retrieval Schemes. - Yael Gertner; Yuval Ishai; Eyal Kushilevitz; Tal Malkin (STOC, 1998)

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces. - Eyal Kushilevitz; Rafail Ostrovsky; Yuval Rabani (STOC, 1998)

Randomness versus Fault-Tolerance. - Ran Canetti; Eyal Kushilevitz; Rafail Ostrovsky; Adi Rosén (IACR Cryptol. ePrint Arch., 1998)

On Learning Read-k-Satisfy-j DNF. - Howard Aizenstein; Avrim Blum; Roni Khardon; Eyal Kushilevitz; Leonard Pitt; Dan Roth 001 (SIAM J. Comput., 1998)

An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks. - Eyal Kushilevitz; Yishay Mansour (SIAM J. Comput., 1998)

A Randomness-Rounds Tradeoff in Private Computation. - Eyal Kushilevitz; Adi Rosén (SIAM J. Discret. Math., 1998)

PAC Learning with Nasty Noise. - Nader H. Bshouty; Nadav Eiron; Eyal Kushilevitz (ALT, 1999)

One-Way Functions Are Essential for Single-Server Private Information Retrieval. - Amos Beimel; Yuval Ishai; Eyal Kushilevitz; Tal Malkin (STOC, 1999)

Improved Upper Bounds on Information-Theoretic Private Information Retrieval (Extended Abstract). - Yuval Ishai; Eyal Kushilevitz (STOC, 1999)

Characterizing Linear Size Circuits in Terms of Pricacy. - Eyal Kushilevitz; Rafail Ostrovsky; Adi Rosén (J. Comput. Syst. Sci., 1999)

Exposure-Resilient Functions and All-or-Nothing Transforms. - Ran Canetti; Yevgeniy Dodis; Shai Halevi; Eyal Kushilevitz; Amit Sahai (EUROCRYPT, 2000)

One-Way Trapdoor Permutations Are Sufficient for Non-trivial Single-Server Private Information Retrieval. - Eyal Kushilevitz; Rafail Ostrovsky (EUROCRYPT, 2000)

Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. - Yuval Ishai; Eyal Kushilevitz (FOCS, 2000)

Learning unions of high-dimensional boxes over the reals. - Amos Beimel; Eyal Kushilevitz (Inf. Process. Lett., 2000)

Learning functions represented as multiplicity automata. - Amos Beimel; Francesco Bergadano; Nader H. Bshouty; Eyal Kushilevitz; Stefano Varricchio (J. ACM, 2000)

Reducibility and Completeness in Private Computations. - Joe Kilian; Eyal Kushilevitz; Silvio Micali; Rafail Ostrovsky (SIAM J. Comput., 2000)

Computing Functions of a Shared Secret. - Amos Beimel; Mike Burmester; Yvo Desmedt; Eyal Kushilevitz (SIAM J. Discret. Math., 2000)

Fair e-Lotteries and e-Casinos. - Eyal Kushilevitz; Tal Rabin (CT-RSA, 2001)

The round complexity of verifiable secret sharing and secure multicast. - Rosario Gennaro; Yuval Ishai; Eyal Kushilevitz; Tal Rabin (STOC, 2001)

Private approximation of NP-hard functions. - Shai Halevi; Robert Krauthgamer; Eyal Kushilevitz; Kobbi Nissim (STOC, 2001)

On 2-Round Secure Multiparty Computation. - Rosario Gennaro; Yuval Ishai; Eyal Kushilevitz; Tal Rabin (CRYPTO, 2002)

Breaking the O(n1/(2k-1)) Barrier for Information-Theoretic Private Information Retrieval. - Amos Beimel; Yuval Ishai; Eyal Kushilevitz; Jean-François Raymond (FOCS, 2002)

Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials. - Yuval Ishai; Eyal Kushilevitz (ICALP, 2002)

Some Applications of Polynomials for the Design of Cryptographic Protocols. - Eyal Kushilevitz (SCN, 2002)

On the Limitations of Universally Composable Two-Party Computation without Set-up Assumptions. - Ran Canetti; Eyal Kushilevitz; Yehuda Lindell (EUROCRYPT, 2003)

Efficient Multi-party Computation over Rings. - Ronald Cramer; Serge Fehr; Yuval Ishai; Eyal Kushilevitz (EUROCRYPT, 2003)

Distribution-Free Property Testing. - Shirley Halevy; Eyal Kushilevitz (RANDOM-APPROX, 2003)

Dynamic routing on networks with fixed-size buffers. - William Aiello; Rafail Ostrovsky; Eyal Kushilevitz; Adi Rosén (SODA, 2003)

Private computation using a PEZ dispenser. - József Balogh; János A. Csirik; Yuval Ishai; Eyal Kushilevitz (Theor. Comput. Sci., 2003)

Distribution-Free Connectivity Testing. - Shirley Halevy; Eyal Kushilevitz (APPROX-RANDOM, 2004)

On the Hardness of Information-Theoretic Multiparty Computation. - Yuval Ishai; Eyal Kushilevitz (EUROCRYPT, 2004)

Cryptography in NC0. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (FOCS, 2004)

Testing Monotonicity over Graph Products. - Shirley Halevy; Eyal Kushilevitz (ICALP, 2004)

Batch codes and their applications. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Amit Sahai (STOC, 2004)

A Lower Bound for Distribution-Free Monotonicity Testing. - Shirley Halevy; Eyal Kushilevitz (APPROX-RANDOM, 2005)

Computationally Private Randomizing Polynomials and Their Applications. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (CCC, 2005)

Learning with attribute costs. - Haim Kaplan; Eyal Kushilevitz; Yishay Mansour (STOC, 2005)

Sufficient Conditions for Collision-Resistant Hashing. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky (TCC, 2005)

General constructions for information-theoretic private information retrieval. - Amos Beimel; Yuval Ishai; Eyal Kushilevitz (J. Comput. Syst. Sci., 2005)

On Pseudorandom Generators with Linear Stretch in NC0. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (APPROX-RANDOM, 2006)

On Combining Privacy with Guaranteed Output Delivery in Secure Multiparty Computation. - Yuval Ishai; Eyal Kushilevitz; Yehuda Lindell; Erez Petrank (CRYPTO, 2006)

Cryptography from Anonymity. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Amit Sahai (FOCS, 2006)

Black-box constructions for secure computation. - Yuval Ishai; Eyal Kushilevitz; Yehuda Lindell; Erez Petrank (STOC, 2006)

Information-theoretically secure protocols and security under composition. - Eyal Kushilevitz; Yehuda Lindell; Tal Rabin (STOC, 2006)

Efficient Arguments without Short PCPs. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky (CCC, 2007)

Cryptography with Constant Input Locality. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (CRYPTO, 2007)

Public Key Encryption That Allows PIR Queries. - Dan Boneh; Eyal Kushilevitz; Rafail Ostrovsky; William E. Skeith III (CRYPTO, 2007)

How Many Oblivious Transfers Are Needed for Secure Multiparty Computation? - Danny Harnik; Yuval Ishai; Eyal Kushilevitz (CRYPTO, 2007)

Zero-knowledge from secure multiparty computation. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Amit Sahai (STOC, 2007)

Cryptography with constant computational overhead. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Amit Sahai (STOC, 2008)

OT-Combiners via Secure Computation. - Danny Harnik; Yuval Ishai; Eyal Kushilevitz; Jesper Buus Nielsen (TCC, 2008)

Distribution-Free Connectivity Testing for Sparse Graphs. - Shirley Halevy; Eyal Kushilevitz (Algorithmica, 2008)

Learning Automata. - Amos Beimel; Francesco Bergadano; Nader H. Bshouty; Eyal Kushilevitz; Stefano Varricchio (Encyclopedia of Algorithms, 2008)

Extracting Correlations. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Amit Sahai (FOCS, 2009)

The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection. - Eyal Kushilevitz; Enav Weinreb (FOCS, 2009)

Partition Arguments in Multiparty Communication Complexity. - Jan Draisma; Eyal Kushilevitz; Enav Weinreb (ICALP (1), 2009)

On the complexity of communication complexity. - Eyal Kushilevitz; Enav Weinreb (STOC, 2009)

Zero-Knowledge Proofs from Secure Multiparty Computation. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Amit Sahai (SIAM J. Comput., 2009)

Secure Multiparty Computation with Minimal Interaction. - Yuval Ishai; Eyal Kushilevitz; Anat Paskin (CRYPTO, 2010)

From Secrecy to Soundness: Efficient Verification via Secure Computation. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (ICALP (1), 2010)

Choosing, Agreeing, and Eliminating in Communication Complexity. - Amos Beimel; Sebastian Ben Daniel; Eyal Kushilevitz; Enav Weinreb (ICALP (1), 2010)

Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (ICS, 2010)

Communication Complexity: From Two-Party to Multiparty. - Eyal Kushilevitz (SIROCCO, 2010)

Constant-Rate Oblivious Transfer from Noisy Channels. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Manoj Prabhakaran 001; Amit Sahai; Jürg Wullschleger (CRYPTO, 2011)

Efficient Non-interactive Secure Computation. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Manoj Prabhakaran 001; Amit Sahai (EUROCRYPT, 2011)

How to Garble Arithmetic Circuits. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (FOCS, 2011)

Black-Box Constructions of Protocols for Secure Computation. - Iftach Haitner; Yuval Ishai; Eyal Kushilevitz; Yehuda Lindell; Erez Petrank (SIAM J. Comput., 2011)

On Achieving the "Best of Both Worlds" in Secure Multiparty Computation. - Yuval Ishai; Jonathan Katz; Eyal Kushilevitz; Yehuda Lindell; Erez Petrank (SIAM J. Comput., 2011)

Share Conversion and Private Information Retrieval. - Amos Beimel; Yuval Ishai; Eyal Kushilevitz; Ilan Orlov (CCC, 2012)

From randomizing polynomials to parallel algorithms. - Yuval Ishai; Eyal Kushilevitz; Anat Paskin-Cherniavsky (ITCS, 2012)

On the (in)security of hash-based oblivious RAM and a new balancing scheme. - Eyal Kushilevitz; Steve Lu 001; Rafail Ostrovsky (SODA, 2012)

Encoding Functions with Constant Online Rate or How to Compress Keys in Garbled Circuits. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz; Brent Waters (IACR Cryptol. ePrint Arch., 2012)

Encoding Functions with Constant Online Rate or How to Compress Garbled Circuits Keys. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz; Brent Waters (CRYPTO (2), 2013)

Robust Pseudorandom Generators. - Yuval Ishai; Eyal Kushilevitz; Xin Li 006; Rafail Ostrovsky; Manoj Prabhakaran 001; Amit Sahai; David Zuckerman (ICALP (1), 2013)

Lossy Chains and Fractional Secret Sharing. - Yuval Ishai; Eyal Kushilevitz; Omer Strulovich (STACS, 2013)

On the Power of Correlated Randomness in Secure Computation. - Yuval Ishai; Eyal Kushilevitz; Sigurd Meldgaard; Claudio Orlandi; Anat Paskin-Cherniavsky (TCC, 2013)

Guest Editorial: In-Network Computation: Exploring the Fundamental Limits. - Panganamala Ramana Kumar; Eyal Kushilevitz; D. Manjunath; Muriel Médard; Alon Orlitsky; R. Srikant 001 (IEEE J. Sel. Areas Commun., 2013)

Non-Interactive Secure Multiparty Computation. - Amos Beimel; Ariel Gabizon; Yuval Ishai; Eyal Kushilevitz; Sigurd Meldgaard; Anat Paskin-Cherniavsky (CRYPTO (2), 2014)

On the Cryptographic Complexity of the Worst Functions. - Amos Beimel; Yuval Ishai; Ranjit Kumaresan; Eyal Kushilevitz (TCC, 2014)

On the Power of Multiplexing in Number-on-the-Forehead Protocols. - Eldar Aharoni; Eyal Kushilevitz (CoRR, 2014)

Cryptography with One-Way Communication. - Sanjam Garg; Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Amit Sahai (CRYPTO (2), 2015)

Secure Computation with Minimal Interaction, Revisited. - Yuval Ishai; Ranjit Kumaresan; Eyal Kushilevitz; Anat Paskin-Cherniavsky (CRYPTO (2), 2015)

Minimizing Locality of One-Way Functions via Semi-Private Randomized Encodings. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz (Electron. Colloquium Comput. Complex., 2015)

Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys. - Benny Applebaum; Yuval Ishai; Eyal Kushilevitz; Brent Waters (SIAM J. Comput., 2015)

Secure Protocol Transformations. - Yuval Ishai; Eyal Kushilevitz; Manoj Prabhakaran 001; Amit Sahai; Ching-Hua Yu (CRYPTO (2), 2016)

Private Large-Scale Databases with Distributed Searchable Symmetric Encryption. - Yuval Ishai; Eyal Kushilevitz; Steve Lu 001; Rafail Ostrovsky (CT-RSA, 2016)

Distribution Design. - Amos Beimel; Ariel Gabizon; Yuval Ishai; Eyal Kushilevitz (ITCS, 2016)

Secure Multiparty Computation with General Interaction Patterns. - Shai Halevi; Yuval Ishai; Abhishek Jain 002; Eyal Kushilevitz; Tal Rabin (ITCS, 2016)

Ad Hoc PSM Protocols: Secure Computation Without Coordination. - Amos Beimel; Yuval Ishai; Eyal Kushilevitz (EUROCRYPT (3), 2017)

Low-Complexity Cryptographic Hash Functions . - Benny Applebaum; Naama Haramaty; Yuval Ishai; Eyal Kushilevitz; Vinod Vaikuntanathan (ITCS, 2017)

Two-Party Direct-Sum Questions Through the Lens of Multiparty Communication Complexity. - Itay Hazan; Eyal Kushilevitz (DISC, 2017)

The Complexity of Multiparty PSM Protocols and Related Models. - Amos Beimel; Eyal Kushilevitz; Pnina Nissim (EUROCRYPT (2), 2018)

Best Possible Information-Theoretic MPC. - Shai Halevi; Yuval Ishai; Eyal Kushilevitz; Tal Rabin (TCC (2), 2018)

Cryptographic Sensing. - Yuval Ishai; Eyal Kushilevitz; Rafail Ostrovsky; Amit Sahai (CRYPTO (3), 2019)

Sub-logarithmic Distributed Oblivious RAM with Small Block Size. - Eyal Kushilevitz; Tamer Mour (Public Key Cryptography (1), 2019)

On Fully Secure MPC with Solitary Output. - Shai Halevi; Yuval Ishai; Eyal Kushilevitz; Nikolaos Makriyannis; Tal Rabin (TCC (1), 2019)

Lower and Upper Bounds on the Randomness Complexity of Private Computations of AND. - Eyal Kushilevitz; Rafail Ostrovsky; Emmanuel Prouff; Adi Rosén; Adrian Thillard; Damien Vergnaud (TCC (2), 2019)

Cryptography from One-Way Communication: On Completeness of Finite Channels. - Shweta Agrawal 001; Yuval Ishai; Eyal Kushilevitz; Varun Narayanan; Manoj Prabhakaran 001; Vinod M. Prabhakaran; Alon Rosen (ASIACRYPT (3), 2020)

Efficient 3-Party Distributed ORAM. - Paul Bunn; Jonathan Katz; Eyal Kushilevitz; Rafail Ostrovsky (SCN, 2020)

Secure Computation from One-Way Noisy Communication, or: Anti-correlation via Anti-concentration. - Shweta Agrawal 001; Yuval Ishai; Eyal Kushilevitz; Varun Narayanan; Manoj Prabhakaran 001; Vinod M. Prabhakaran; Alon Rosen (CRYPTO (2), 2021)

Falcon: Honest-Majority Maliciously Secure Framework for Private Deep Learning. - Sameer Wagh; Shruti Tople; Fabrice Benhamouda; Eyal Kushilevitz; Prateek Mittal; Tal Rabin (Proc. Priv. Enhancing Technol., 2021)

CNF-FSS and Its Applications. - Paul Bunn; Eyal Kushilevitz; Rafail Ostrovsky (Public Key Cryptography (1), 2022)

Random-Index Oblivious RAM. - Shai Halevi; Eyal Kushilevitz (TCC (3), 2022)

Perfect MPC over Layered Graphs. - Bernardo David; Giovanni Deligios; Aarushi Goel; Yuval Ishai; Anders Konring; Eyal Kushilevitz; Chen-Da Liu-Zhang; Varun Narayanan (CRYPTO (1), 2023)

Additive Randomized Encodings and Their Applications. - Shai Halevi; Yuval Ishai; Eyal Kushilevitz; Tal Rabin (CRYPTO (1), 2023)

Succinct Computational Secret Sharing. - Benny Applebaum; Amos Beimel; Yuval Ishai; Eyal Kushilevitz; Tianren Liu; Vinod Vaikuntanathan (STOC, 2023)

Hard Languages in NP ∩ coNP and NIZK Proofs from Unstructured Hardness. - Riddhi Ghosal; Yuval Ishai; Alexis Korb; Eyal Kushilevitz; Paul Lou; Amit Sahai (STOC, 2023)

Cryptography from Planted Graphs: Security with Logarithmic-Size Messages. - Damiano Abram; Amos Beimel; Yuval Ishai; Eyal Kushilevitz; Varun Narayanan (TCC (1), 2023)

Anonymous Permutation Routing. - Paul Bunn; Eyal Kushilevitz; Rafail Ostrovsky (TCC (3), 2023)

Hard Languages in $ text{NP} cap text{coNP}$ and NIZK Proofs from Unstructured Hardness. - Riddhi Ghosal; Yuval Ishai; Alexis Korb; Eyal Kushilevitz; Paul Lou; Amit Sahai (Electron. Colloquium Comput. Complex., 2023)

Perfect MPC over Layered Graphs. - Bernardo David; Anders Konring; Yuval Ishai; Eyal Kushilevitz; Varun Narayanan (IACR Cryptol. ePrint Arch., 2023)

Hard Languages in $ mathsf{NP} cap mathsf{coNP}$ and NIZK Proofs from Unstructured Hardness. - Riddhi Ghosal; Yuval Ishai; Alexis Korb; Eyal Kushilevitz; Paul Lou; Amit Sahai (IACR Cryptol. ePrint Arch., 2023)

Query-Reusable Proof Systems. - Yuval Ishai; Eyal Kushilevitz; Varun Narayanan; Rafail Ostrovsky; Akash Shah (EUROCRYPT (4), 2025)