Eli Ben-Sasson

发表

Pseudorandom generators in propositional proof complexity

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

Composition of Semi-LTCs by Two-Wise Tensor Products

Eli Ben-Sasson, Michael Viderman, 2009, APPROX-RANDOM.

Proximity Gaps for Reed–Solomon Codes

Yuval Ishai, Eli Ben-Sasson, Shubhangi Saraf, 2020, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

Size space tradeoffs for resolution

Eli Ben-Sasson, Eli Ben-Sasson, 2002, STOC '02.

Random Cnf’s are Hard for the Polynomial Calculus

Eli Ben-Sasson, Russell Impagliazzo, 2010, computational complexity.

On Sums of Locally Testable Affine Invariant Properties

Eli Ben-Sasson, Madhu Sudan, Elena Grigorescu, 2011, APPROX-RANDOM.

Space complexity of random formulae in resolution

Eli Ben-Sasson, Nicola Galesi, E. Ben-Sasson, 2003, Random Struct. Algorithms.

Space complexity in propositional calculus

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2000, STOC '00.

Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications pdf

Madhur Tulsiani, Eli Ben-Sasson, Julia Wolf, 2012, ICALP.

Tensor Products of Weakly Smooth Codes are Robust

Eli Ben-Sasson, Michael Viderman, Eli Ben-Sasson, 2008, Theory Comput..

Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution)

Eli Ben-Sasson, Abdelrahaman Aly, Tomer Ashur, 2019, IACR Cryptol. ePrint Arch..

Short proofs are narrow—resolution made simple

Eli Ben-Sasson, Avi Wigderson, 2001, JACM.

Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic

Eli Ben-Sasson, Ariel Gabizon, Ariel Gabizon, 2012, APPROX-RANDOM.

Subspace Polynomials and Cyclic Subspace Codes

Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, 2014, IEEE Transactions on Information Theory.

An Additive Combinatorics Approach Relating Rank to Communication Complexity

Shachar Lovett, Eli Ben-Sasson, Noga Ron-Zewi, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Random Cnf’s are Hard for the Polynomial Calculus

Eli Ben-Sasson, Russell Impagliazzo, R. Impagliazzo, 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

Breaking local symmetries can dramatically reduce the length of propositional refutations

David R. Karger, Eli Ben-Sasson, Shir Ben-Israel, 2010, Electron. Colloquium Comput. Complex..

Scalable Zero Knowledge Via Cycles of Elliptic Curves

Eli Ben-Sasson, Eran Tromer, Alessandro Chiesa, 2016, Algorithmica.

A new family of locally correctable codes based on degree-lifted algebraic geometry codes

Eli Ben-Sasson, Shubhangi Saraf, Ariel Gabizon, 2013, STOC '13.

On the information leakage of public-output protocols

Eli Ben-Sasson, Gal Maor, 2015, Electron. Colloquium Comput. Complex..

Sparse Affine-Invariant Linear Codes Are Locally Testable

Eli Ben-Sasson, Madhu Sudan, Noga Ron-Zewi, 2012, FOCS.

Linear upper bounds for random walk on small density random 3-CNFs

Michael Alekhnovich, Eli Ben-Sasson, 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

Zerocash: Decentralized Anonymous Payments from Bitcoin

Eli Ben-Sasson, Ian Miers, Eran Tromer, 2014, 2014 IEEE Symposium on Security and Privacy.

Short PCPs with Projection Queries

Emanuele Viola, Eli Ben-Sasson, Emanuele Viola, 2014, ICALP.

From affine to two-source extractors via approximate duality

Eli Ben-Sasson, Noga Ron-Zewi, Noga Ron-Zewi, 2011, STOC '11.

Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols

Eli Ben-Sasson, Abdelrahaman Aly, Tomer Ashur, 2020, IACR Trans. Symmetric Cryptol..

A security analysis of Probabilistically Checkable Proofs

Eli Ben-Sasson, Ariel Gabizon, Iddo Bentov, 2016, Electron. Colloquium Comput. Complex..

Robust locally testable codes and products of codes

Eli Ben-Sasson, Madhu Sudan, M. Sudan, 2004, Random Struct. Algorithms.

Locally Testable Codes Require Redundant Testers

Venkatesan Guruswami, Eli Ben-Sasson, Madhu Sudan, 2009, Computational Complexity Conference.

Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols

Eli Ben-Sasson, Abdelrahaman Aly, Tomer Ashur, 2020 .

Subspace Polynomials and Cyclic Subspace Codes

Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, 2016, IEEE Trans. Inf. Theory.

Space complexity of random formulae in resolution

Eli Ben-Sasson, Nicola Galesi, 2001, Proceedings 16th Annual IEEE Conference on Computational Complexity.

Near Optimal Separation Of Tree-Like And General Resolution

Eli Ben-Sasson, Avi Wigderson, Russell Impagliazzo, 2004, Comb..

Towards Lower Bounds on Locally Testable Codes via Density Arguments

Eli Ben-Sasson, Michael Viderman, 2011, Computational Complexity Conference.

Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions

Eli Ben-Sasson, Jakob Nordström, 2011, ICS.

Lower bounds for bounded depth Frege proofs via Pudlák-Buss games

Eli Ben-Sasson, Prahladh Harsha, 2010, TOCL.

Fast Multiplication in Binary Fields on GPUs via Register Cache

Eli Ben-Sasson, Mark Silberstein, Eran Tromer, 2016, ICS.

Aurora: Transparent Succinct Arguments for R1CS

Eli Ben-Sasson, Nicholas Spooner, Alessandro Chiesa, 2019, IACR Cryptol. ePrint Arch..

Some 3CNF properties are hard to test

Eli Ben-Sasson, Sofya Raskhodnikova, Prahladh Harsha, 2003, STOC '03.

Space Complexity in Propositional Calculus

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2002, SIAM J. Comput..

Limits on the Rate of Locally Testable Affine-Invariant Codes

Eli Ben-Sasson, Madhu Sudan, M. Sudan, 2011, APPROX-RANDOM.

Worst-Case to Average Case Reductions for the Distance to a Code

Eli Ben-Sasson, Shubhangi Saraf, Swastik Kopparty, 2018, CCC.

A combinatorial characterization of smooth LTCs and applications

Eli Ben-Sasson, Michael Viderman, Eli Ben-Sasson, 2016, Random Struct. Algorithms.

Scalable, transparent, and post-quantum secure computational integrity

Eli Ben-Sasson, Iddo Bentov, Michael Riabzev, 2018, IACR Cryptol. ePrint Arch..

Sound 3-Query PCPPs Are Long

Eli Ben-Sasson, Oded Lachish, Arie Matsliah, 2008, TOCT.

Locally Testable Codes Require Redundant Testers

Venkatesan Guruswami, Eli Ben-Sasson, Michael Viderman, 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs

Eli Ben-Sasson, Daniel Genkin, Eran Tromer, 2012, Electron. Colloquium Comput. Complex..

Interactive Oracle Proofs

Eli Ben-Sasson, Nicholas Spooner, Alessandro Chiesa, 2016, TCC.

STARK Friendly Hash - Survey and Recommendation

Eli Ben-Sasson, Lior Goldberg, David Levit, 2020, IACR Cryptol. ePrint Arch..

An Approach to Bounded Rationality

Adam Tauman Kalai, Eli Ben-Sasson, Ehud Kalai, 2006, NIPS.

3CNF Properties are Hard to Test

Eli Ben-Sasson, Sofya Raskhodnikova, Prahladh Harsha, 2003, Electron. Colloquium Comput. Complex..

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

Eli Ben-Sasson, Eran Tromer, Alessandro Chiesa, 2014, USENIX Security Symposium.

Interactive Oracle Proofs with Constant Rate and Query Complexity

Eli Ben-Sasson, Ariel Gabizon, Nicholas Spooner, 2017, ICALP.

Collaborative Discovery: A study of Guru-follower dynamics

Eli Ben-Sasson, Eden Saig, Eli Ben-Sasson, 2017, Electron. Colloquium Comput. Complex..

Brief Announcement: Towards an Abstract Model of User Retention Dynamics

Eli Ben-Sasson, Eden Saig, 2018, ICALP.

Bitcoin and Secure Computation with Money

Eli Ben-Sasson, Iddo Bentov, Iddo Bentov, 2017 .

Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs

Eli Ben-Sasson, Eran Tromer, Matthew Green, 2015, 2015 IEEE Symposium on Security and Privacy.

Low Rate Is Insufficient for Local Testability

Eli Ben-Sasson, Michael Viderman, Eli Ben-Sasson, 2010, APPROX-RANDOM.

An Additive Combinatorics Approach Relating Rank to Communication Complexity

Shachar Lovett, Eli Ben-Sasson, Noga Ron-Zewi, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Robust locally testable codes and products of codes

Eli Ben-Sasson, Madhu Sudan, M. Sudan, 2004, Random Struct. Algorithms.

Improved concrete efficiency and security analysis of Reed-Solomon PCPPs

Eli Ben-Sasson, Ariel Gabizon, Iddo Bentov, 2016, Electron. Colloquium Comput. Complex..

Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

Eli Ben-Sasson, Oded Goldreich, Madhu Sudan, 2004, SIAM J. Comput..

DEEP-FRI: Sampling outside the box improves soundness

Eli Ben-Sasson, Shubhangi Saraf, Swastik Kopparty, 2019, IACR Cryptol. ePrint Arch..

Lower bound for communication complexity with no public randomness

Eli Ben-Sasson, Gal Maor, 2015, Electron. Colloquium Comput. Complex..

Short PCPs with Polylog Query Complexity

Eli Ben-Sasson, Madhu Sudan, E. Ben-Sasson, 2008, SIAM J. Comput..

Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games

Eli Ben-Sasson, Prahladh Harsha, 2003, Electron. Colloquium Comput. Complex..

Short PCPs verifiable in polylogarithmic time

Eli Ben-Sasson, Oded Goldreich, Salil P. Vadhan, 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

Simple PCPs with poly-log rate and query complexity

Eli Ben-Sasson, Madhu Sudan, M. Sudan, 2005, STOC '05.

On the concrete efficiency of probabilistically-checkable proofs

Eli Ben-Sasson, Daniel Genkin, Eran Tromer, 2013, STOC '13.

Some 3CNF Properties Are Hard to Test

Eli Ben-Sasson, Sofya Raskhodnikova, Prahladh Harsha, 2005, SIAM J. Comput..

Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems (full version)

Eli Ben-Sasson, Daniel Genkin, Eran Tromer, 2012 .

Towards lower bounds on locally testable codes via density arguments

Eli Ben-Sasson, Michael Viderman, Eli Ben-Sasson, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

Special Section on the Fifty-Second IEEE Annual Symposium on Foundations of Computer Science (FOCS 2011)

Rafail Ostrovsky, Eli Ben-Sasson, 2014, SIAM J. Comput..

Baby CROINC: an online, crowd-based, expert-curated system for monitoring child development

Eli Ben-Sasson, Ayelet Ben-Sasson, Eden Saig, 2017, PervasiveHealth.

Hard examples for the bounded depth Frege proof system

Eli Ben-Sasson, 2003, computational complexity.

The Complexity of User Retention

Eli Ben-Sasson, Eden Saig, Eli Ben-Sasson, 2018, ITCS.

Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity

Or Meir, Eli Ben-Sasson, Henning Stichtenoth, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Sound 3-Query PCPPs Are Long

Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, 2008, ICALP.

Subspace Polynomials and Limits to List Decoding of Reed–Solomon Codes

Jaikumar Radhakrishnan, Eli Ben-Sasson, Swastik Kopparty, 2010, IEEE Transactions on Information Theory.

Linear-Size Constant-Query IOPs for Delegating Computation

Eli Ben-Sasson, Tom Gur, Nicholas Spooner, 2019, IACR Cryptol. ePrint Arch..

Affine dispersers from subspace polynomials

Eli Ben-Sasson, Swastik Kopparty, Swastik Kopparty, 2009, STOC '09.

Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

Eli Ben-Sasson, Daniel Genkin, Eran Tromer, 2013, ITCS '13.

Fast Reed-Solomon Interactive Oracle Proofs of Proximity

Eli Ben-Sasson, Iddo Bentov, Michael Riabzev, 2017, Electron. Colloquium Comput. Complex..

Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width

Eli Ben-Sasson, Jan Johannsen, Jan Johannsen, 2011, IJCAI.

From affine to two-source extractors via approximate duality

Eli Ben-Sasson, Noga Ron-Zewi, 2011, STOC '11.

Short Proofs Are Narrow - Resolution Made Simple (Abstract).

Eli Ben-Sasson, Avi Wigderson, A. Wigderson, 1999 .

Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck

Eli Ben-Sasson, Ariel Gabizon, Nicholas Spooner, 2016, IACR Cryptol. ePrint Arch..

Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic

Eli Ben-Sasson, Ariel Gabizon, Ariel Gabizon, 2013, Theory Comput..

Scalable Zero Knowledge Via Cycles of Elliptic Curves

Eli Ben-Sasson, Eran Tromer, Alessandro Chiesa, 2014, Algorithmica.

Affine Dispersers from Subspace Polynomials

Eli Ben-Sasson, Swastik Kopparty, 2012, SIAM J. Comput..

Pseudorandom Generators in Propositional Proof Complexity

Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, 2004, SIAM J. Comput..

Bounds on 2-Query Codeword Testing

Eli Ben-Sasson, Oded Goldreich, Madhu Sudan, 2003, RANDOM-APPROX.

Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs

Eli Ben-Sasson, Ariel Gabizon, Alessandro Chiesa, 2016, TCC.

Understanding Space in Resolution: Optimal Lower Bounds and Exponential Trade-offs

Eli Ben-Sasson, Jakob Nordström, 2009, Electron. Colloquium Comput. Complex..

Randomness-efficient low degree tests and short PCPs via epsilon-biased sets

Eli Ben-Sasson, Avi Wigderson, Salil P. Vadhan, 2003, STOC '03.

Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs

Eli Ben-Sasson, Mikhail Alekhnovich, 2007, SIAM J. Comput..

SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

Eli Ben-Sasson, Daniel Genkin, Eran Tromer, 2013, CRYPTO.

On Public Key Encryption from Noisy Codewords

Yuval Ishai, Ivan Damgård, Eli Ben-Sasson, 2016, Public Key Cryptography.

Computational Integrity with a Public Random String from Quasi-Linear PCPs

Eli Ben-Sasson, Daniel Genkin, Mark Silberstein, 2017, EUROCRYPT.

Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority

Rafail Ostrovsky, Eli Ben-Sasson, Serge Fehr, 2012, CRYPTO.

Succinct Computational Integrity and Privacy Research (SCIPR)

Eli Ben-Sasson, 2013 .

Short proofs are narrow-resolution made simple

Eli Ben-Sasson, Avi Wigderson, A. Wigderson, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Tensor Products of Weakly Smooth Codes Are Robust

Eli Ben-Sasson, Michael Viderman, 2008, APPROX-RANDOM.

Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution

Eli Ben-Sasson, Jakob Nordström, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas

Eli Ben-Sasson, Jan Johannsen, 2010, SAT.

Composition of semi-LTCs by two-wise tensor products

Eli Ben-Sasson, Michael Viderman, Eli Ben-Sasson, 2009, computational complexity.

On Probabilistic Checking in Perfect Zero Knowledge

Eli Ben-Sasson, Ariel Gabizon, Michael A. Forbes, 2016, IACR Cryptol. ePrint Arch..

Scalable Zero Knowledge with No Trusted Setup

Eli Ben-Sasson, Iddo Bentov, Michael Riabzev, 2019, CRYPTO.

Subspace Polynomials and List Decoding of Reed-Solomon Codes

Jaikumar Radhakrishnan, Eli Ben-Sasson, Swastik Kopparty, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

A Space Hierarchy for k-DNF Resolution

Eli Ben-Sasson, Jakob Nordström, 2009, Electron. Colloquium Comput. Complex..

Sparse affine-invariant linear codes are locally testable

Eli Ben-Sasson, Madhu Sudan, Noga Ron-Zewi, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Limitation on the Rate of Families of Locally Testable Codes

Eli Ben-Sasson, Eli Ben-Sasson, 2010, Property Testing.

Zero Knowledge Protocols from Succinct Constraint Detection

Eli Ben-Sasson, Ariel Gabizon, Michael A. Forbes, 2017, TCC.

Robust pcps of proximity, shorter pcps and applications to coding

Eli Ben-Sasson, Oded Goldreich, Madhu Sudan, 2004, STOC '04.

An additive combinatorics approach to the log-rank conjecture in communication complexity pdf

Shachar Lovett, Eli Ben-Sasson, Noga Ron-Zewi, 2011, Electron. Colloquium Comput. Complex..

Succinct Non-Interactive Arguments for a von Neumann Architecture

Eli Ben-Sasson, Eran Tromer, Alessandro Chiesa, 2013, IACR Cryptol. ePrint Arch..

Evaluating Expert Curation in a Baby Milestone Tracking App

Eli Ben-Sasson, Ayelet Ben-Sasson, Eden Saig, 2019, CHI.

Symmetric LDPC Codes are not Necessarily Locally Testable

Eli Ben-Sasson, Madhu Sudan, Amir Shpilka, 2011, 2011 IEEE 26th Annual Conference on Computational Complexity.

ICALP 2014: Automata, Languages, and Programming

Madhur Tulsiani, Eli Ben-Sasson, Noga Ron-Zewi, 2014 .

Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity

Or Meir, Eli Ben-Sasson, Henning Stichtenoth, 2013, FOCS.

Hard examples for bounded depth frege

Eli Ben-Sasson, 2002, STOC '02.

Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields pdf

Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, 2021, Electron. Colloquium Comput. Complex..

Analysis of the Random Walk Algorithm on Random -CNFs

Eli Ben-Sasson, Mikhail Alekhnovich, E. Ben-Sasson, 2003 .

TinyRAM Architecture Specification v 0 . 991

Eli Ben-Sasson, Daniel Genkin, Eran Tromer, 2013 .

Size-Space Tradeoffs for Resolution

Eli Ben-Sasson, 2009 .

Understanding Space in Proof Complexity: Separations and Trade-ofis via Substitutions (Extended Abstract)

Eli Ben-Sasson, Eli Ben-Sasson, 2011 .