| 2026 | STOC | On Proximity Gaps of Reed-Solomon Codes. | Eli Ben-Sasson, Dan Carmon, Ulrich Habck, Swastik Kopparty, Shubhangi Saraf |
| 2023 | SODA | Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Low-degree Extension in Time | Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit |
| 2022 | TCC | Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - (ECFFT Part II). | Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit |
| 2020 | FOCS | Proximity Gaps for Reed-Solomon Codes. | Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf |
| 2019 | CHI | Evaluating Expert Curation in a Baby Milestone Tracking App. | Ayelet Ben-Sasson, Eli Ben-Sasson, Kayla Jacobs, Elisheva Rotman Argaman, Eden Saig |
| 2019 | CRYPTO | Scalable Zero Knowledge with No Trusted Setup. | Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev |
| 2019 | EuroCrypt | Aurora: Transparent Succinct Arguments for R1CS. | Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward |
| 2019 | TCC | Linear-Size Constant-Query IOPs for Delegating Computation. | Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner |
| 2018 | ICALP | Fast Reed-Solomon Interactive Oracle Proofs of Proximity. | Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev |
| 2018 | ICALP | Brief Announcement: Towards an Abstract Model of User Retention Dynamics. | Eli Ben-Sasson, Eden Saig |
| 2017 | EuroCrypt | Computational Integrity with a Public Random String from Quasi-Linear PCPs. | Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza |
| 2017 | ICALP | Interactive Oracle Proofs with Constant Rate and Query Complexity. | Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner |
| 2017 | TCC | Zero Knowledge Protocols from Succinct Constraint Detection. | Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner |
| 2016 | ICS | Fast Multiplication in Binary Fields on GPUs via Register Cache. | Eli Ben-Sasson, Matan Hamilis, Mark Silberstein, Eran Tromer |
| 2016 | PKC | On Public Key Encryption from Noisy Codewords. | Eli Ben-Sasson, Iddo Bentov, Ivan Damgrd, Yuval Ishai, Noga Ron-Zewi |
| 2016 | TCC | Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. | Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza |
| 2016 | TCC | Interactive Oracle Proofs. | Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner |
| 2015 | ISIT | Subspace polynomials and cyclic subspace codes. | Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv |
| 2015 | SP | Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs. | Eli Ben-Sasson, Alessandro Chiesa, Matthew Green, Eran Tromer, Madars Virza |
| 2014 | CRYPTO | Scalable Zero Knowledge via Cycles of Elliptic Curves. | Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza |
| 2014 | ICALP | Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications. | Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf |
| 2014 | ICALP | Short PCPs with Projection Queries. | Eli Ben-Sasson, Emanuele Viola |
| 2014 | SP | Zerocash: Decentralized Anonymous Payments from Bitcoin. | Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza |
| 2013 | CRYPTO | SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. | Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza |
| 2013 | FOCS | Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. | Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth |
| 2013 | STOC | On the concrete efficiency of probabilistically-checkable proofs. | Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer |
| 2013 | STOC | A new family of locally correctable codes based on degree-lifted algebraic geometry codes. | Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf |
| 2012 | CRYPTO | Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. | Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky |
| 2012 | FOCS | An Additive Combinatorics Approach Relating Rank to Communication Complexity. | Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi |
| 2012 | FOCS | Sparse Affine-Invariant Linear Codes Are Locally Testable. | Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan |
| 2011 | IJCAI | Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width. | Eli Ben-Sasson, Jan Johannsen |
| 2011 | STOC | From affine to two-source extractors via approximate duality. | Noga Zewi, Eli Ben-Sasson |
| 2010 | SAT | Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas. | Eli Ben-Sasson, Jan Johannsen |
| 2009 | STOC | Affine dispersers from subspace polynomials. | Eli Ben-Sasson, Swastik Kopparty |
| 2008 | FOCS | Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. | Eli Ben-Sasson, Jakob Nordstrm |
| 2008 | ICALP | Sound 3-Query PCPPs Are Long. | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah |
| 2006 | FOCS | Subspace Polynomials and List Decoding of Reed-Solomon Codes. | Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan |
| 2005 | STOC | Simple PCPs with poly-log rate and query complexity. | Eli Ben-Sasson, Madhu Sudan |
| 2004 | STOC | Robust pcps of proximity, shorter pcps and applications to coding. | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
| 2003 | FOCS | Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. | Michael Alekhnovich, Eli Ben-Sasson |
| 2003 | STOC | Some 3CNF properties are hard to test. | Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova |
| 2003 | STOC | Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. | Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson |
| 2002 | STOC | Size space tradeoffs for resolution. | Eli Ben-Sasson |
| 2002 | STOC | Hard examples for bounded depth frege. | Eli Ben-Sasson |
| 2000 | FOCS | Pseudorandom Generators in Propositional Proof Complexity. | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
| 2000 | STOC | Space complexity in propositional calculus. | Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson |
| 1999 | FOCS | Random CNF's are Hard for the Polynomial Calculus. | Eli Ben-Sasson, Russell Impagliazzo |
| 1999 | STOC | Short Proofs are Narrow - Resolution Made Simple. | Eli Ben-Sasson, Avi Wigderson |