Eli Ben-Sasson

ORCID

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 64

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

CoRR

ICALP

Publications

Ayelet Ben-Sasson, Kayla Jacobs, Eli Ben-Sasson
Early childhood tracking application: Correspondence between crowd-based developmental percentiles and clinical tools. Health Informatics J. 29 (1) (2023)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
) over all Finite Fields. SODA (2023)
Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
Proximity Gaps for Reed-Solomon Codes. J. ACM 70 (5) (2023)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves - (ECFFT Part II). TCC (1) (2022)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves. Electron. Colloquium Comput. Complex. (2022)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves (ECFFT part II). IACR Cryptol. ePrint Arch. 2022 (2022)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. Electron. Colloquium Comput. Complex. 28 (2021)
Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. CoRR (2021)
Eli Ben-Sasson, Lior Goldberg, David Levit
STARK Friendly Hash - Survey and Recommendation. IACR Cryptol. ePrint Arch. 2020 (2020)
Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
DEEP-FRI: Sampling Outside the Box Improves Soundness. ITCS (2020)
Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
Proximity Gaps for Reed-Solomon Codes. Electron. Colloquium Comput. Complex. 27 (2020)
Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, Alan Szepieniec
Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols. IACR Trans. Symmetric Cryptol. 2020 (3) (2020)
Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
Proximity Gaps for Reed-Solomon Codes. IACR Cryptol. ePrint Arch. 2020 (2020)
Eli Ben-Sasson, Dan Carmon, Yuval Ishai, Swastik Kopparty, Shubhangi Saraf
Proximity Gaps for Reed-Solomon Codes. FOCS (2020)
Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev
Scalable Zero Knowledge with No Trusted Setup. CRYPTO (3) (2019)
Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
DEEP-FRI: Sampling outside the box improves soundness. CoRR (2019)
Eli Ben-Sasson, Eden Saig
The Complexity of User Retention. ITCS (2019)
Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner
Linear-Size Constant-Query IOPs for Delegating Computation. IACR Cryptol. ePrint Arch. 2019 (2019)
Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
DEEP-FRI: Sampling Outside the Box Improves Soundness. Electron. Colloquium Comput. Complex. 26 (2019)
Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward
Aurora: Transparent Succinct Arguments for R1CS. EUROCRYPT (1) (2019)
Ayelet Ben-Sasson, Eli Ben-Sasson, Kayla Jacobs, Elisheva Rotman Argaman, Eden Saig
Evaluating Expert Curation in a Baby Milestone Tracking App. CHI (2019)
Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner
Linear-Size Constant-Query IOPs for Delegating Computation. TCC (2) (2019)
Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf
DEEP-FRI: Sampling Outside the Box Improves Soundness. IACR Cryptol. ePrint Arch. 2019 (2019)
Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, Alan Szepieniec
Efficient Symmetric Primitives for Advanced Cryptographic Protocols (A Marvellous Contribution). IACR Cryptol. ePrint Arch. 2019 (2019)
Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev
Fast Reed-Solomon Interactive Oracle Proofs of Proximity. ICALP (2018)
Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf
Worst-case to average case reductions for the distance to a code. Electron. Colloquium Comput. Complex. 25 (2018)
Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward
Aurora: Transparent Succinct Arguments for R1CS. IACR Cryptol. ePrint Arch. 2018 (2018)
Eli Ben-Sasson, Swastik Kopparty, Shubhangi Saraf
Worst-Case to Average Case Reductions for the Distance to a Code. Computational Complexity Conference (2018)
Eli Ben-Sasson, Eden Saig
Brief Announcement: Towards an Abstract Model of User Retention Dynamics. ICALP (2018)
Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev
Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. 2018 (2018)
Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
Interactive Oracle Proofs with Constant Rate and Query Complexity. ICALP (2017)
Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
Scalable Zero Knowledge Via Cycles of Elliptic Curves. Algorithmica 79 (4) (2017)
Ayelet Ben-Sasson, Eli Ben-Sasson, Kayla Jacobs, Eden Saig
Baby CROINC: an online, crowd-based, expert-curated system for monitoring child development. PervasiveHealth (2017)
Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
Zero Knowledge Protocols from Succinct Constraint Detection. TCC (2) (2017)
Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza
Computational Integrity with a Public Random String from Quasi-Linear PCPs. EUROCRYPT (3) (2017)
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
Sparse affine-invariant linear codes are locally testable. Comput. Complex. 26 (1) (2017)
Eli Ben-Sasson, Eden Saig
Collaborative Discovery: A study of Guru-follower dynamics. Electron. Colloquium Comput. Complex. 24 (2017)
Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, Michael Riabzev
Fast Reed-Solomon Interactive Oracle Proofs of Proximity. Electron. Colloquium Comput. Complex. 24 (2017)
Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner
Interactive Oracle Proofs. TCC (B2) (2016)
Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
On Probabilistic Checking in Perfect Zero Knowledge. IACR Cryptol. ePrint Arch. 2016 (2016)
Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi
On Public Key Encryption from Noisy Codewords. Public Key Cryptography (2) (2016)
Eli Ben-Sasson, Iddo Bentov, Ariel Gabizon, Michael Riabzev
A security analysis of Probabilistically Checkable Proofs. Electron. Colloquium Comput. Complex. 23 (2016)
Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. J. ACM 63 (4) (2016)
Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. IACR Cryptol. ePrint Arch. 2016 (2016)
Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv
Subspace Polynomials and Cyclic Subspace Codes. IEEE Trans. Inf. Theory 62 (3) (2016)
Eli Ben-Sasson, Iddo Bentov, Ariel Gabizon, Michael Riabzev
Improved concrete efficiency and security analysis of Reed-Solomon PCPPs. Electron. Colloquium Comput. Complex. 23 (2016)
Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. Electron. Colloquium Comput. Complex. 23 (2016)
Eli Ben-Sasson, Iddo Bentov, Alessandro Chiesa, Ariel Gabizon, Daniel Genkin, Matan Hamilis, Evgenya Pergament, Michael Riabzev, Mark Silberstein, Eran Tromer, Madars Virza
Computational integrity with a public random string from quasi-linear PCPs. IACR Cryptol. ePrint Arch. 2016 (2016)
Eli Ben-Sasson, Michael Viderman
A combinatorial characterization of smooth LTCs and applications. Random Struct. Algorithms 49 (2) (2016)
Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. IACR Cryptol. ePrint Arch. 2016 (2016)
Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner
Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2016 (2016)
Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. Electron. Colloquium Comput. Complex. 23 (2016)
Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
On Probabilistic Checking in Perfect Zero Knowledge. Electron. Colloquium Comput. Complex. 23 (2016)
Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner
On Probabilistic Checking in Perfect Zero Knowledge. CoRR (2016)
Eli Ben-Sasson, Matan Hamilis, Mark Silberstein, Eran Tromer
Fast Multiplication in Binary Fields on GPUs via Register Cache. ICS (2016)
Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Madars Virza
Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs. TCC (A2) (2016)
Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv
Subspace polynomials and cyclic subspace codes. ISIT (2015)
Eli Ben-Sasson, Gal Maor
On the information leakage of public-output protocols. Electron. Colloquium Comput. Complex. 22 (2015)
Eli Ben-Sasson, Michael Viderman
Composition of semi-LTCs by two-wise tensor products. Comput. Complex. 24 (3) (2015)
Eli Ben-Sasson, Gal Maor
Lower bound for communication complexity with no public randomness. Electron. Colloquium Comput. Complex. 22 (2015)
Eli Ben-Sasson, Alessandro Chiesa, Matthew Green, Eran Tromer, Madars Virza
Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs. IEEE Symposium on Security and Privacy (2015)
Eli Ben-Sasson, Iddo Bentov, Ivan Damgård, Yuval Ishai, Noga Ron-Zewi
On Public Key Encryption from Noisy Codewords. IACR Cryptol. ePrint Arch. 2015 (2015)
Eli Ben-Sasson, Noga Ron-Zewi
From Affine to Two-Source Extractors via Approximate Duality. SIAM J. Comput. 44 (6) (2015)
Eli Ben-Sasson, Iddo Bentov, Ivan Bjerre Damgård, Yuval Ishai, Noga Ron-Zewi
On Public Key Encryption from Noisy Codewords. Electron. Colloquium Comput. Complex. 22 (2015)
Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
Scalable Zero Knowledge via Cycles of Elliptic Curves. IACR Cryptol. ePrint Arch. 2014 (2014)
Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza
Zerocash: Decentralized Anonymous Payments from Bitcoin. IEEE Symposium on Security and Privacy (2014)
Eli Ben-Sasson, Tuvi Etzion, Ariel Gabizon, Netanel Raviv
Subspace Polynomials and Cyclic Subspace Codes. CoRR (2014)
Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture. USENIX Security Symposium (2014)
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications. ICALP (1) (2014)
Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
Scalable Zero Knowledge via Cycles of Elliptic Curves. CRYPTO (2) (2014)
Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi
An Additive Combinatorics Approach Relating Rank to Communication Complexity. J. ACM 61 (4) (2014)
Eli Ben-Sasson, Emanuele Viola
Short PCPs with projection queries. Electron. Colloquium Comput. Complex. 21 (2014)
Eli Ben-Sasson, Alessandro Chiesa, Christina Garman, Matthew Green, Ian Miers, Eran Tromer, Madars Virza
Zerocash: Decentralized Anonymous Payments from Bitcoin. IACR Cryptol. ePrint Arch. 2014 (2014)
Eli Ben-Sasson, Emanuele Viola
Short PCPs with Projection Queries. ICALP (1) (2014)
Eli Ben-Sasson, Ariel Gabizon
Extractors for Polynomial Sources over Fields of Constant Order and Small Characteristic. Theory Comput. 9 (2013)
Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. IACR Cryptol. ePrint Arch. 2013 (2013)
Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer
Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract. ITCS (2013)
Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity. FOCS (2013)
Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. STOC (2013)
Eli Ben-Sasson, Yohay Kaplan, Swastik Kopparty, Or Meir, Henning Stichtenoth
Constant rate PCPs for circuit-SAT with sublinear query complexity. Electron. Colloquium Comput. Complex. 20 (2013)
Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer, Madars Virza
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge. CRYPTO (2) (2013)
Eli Ben-Sasson, Alessandro Chiesa, Eran Tromer, Madars Virza
Succinct Non-Interactive Arguments for a von Neumann Architecture. IACR Cryptol. ePrint Arch. 2013 (2013)
Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer
On the concrete efficiency of probabilistically-checkable proofs. STOC (2013)
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
Sparse Affine-Invariant Linear Codes Are Locally Testable. FOCS (2012)
Eli Ben-Sasson, Swastik Kopparty
Affine Dispersers from Subspace Polynomials. SIAM J. Comput. 41 (4) (2012)
Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer
On the Concrete-Efficiency Threshold of Probabilistically-Checkable Proofs. Electron. Colloquium Comput. Complex. 19 (2012)
Eli Ben-Sasson, Michael Viderman
A Combinatorial Characterization of smooth LTCs and Applications. Electron. Colloquium Comput. Complex. 19 (2012)
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
Sampling-based proofs of almost-periodicity results and algorithmic applications. Electron. Colloquium Comput. Complex. 19 (2012)
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
Sparse affine-invariant linear codes are locally testable. Electron. Colloquium Comput. Complex. 19 (2012)
Eli Ben-Sasson, Michael Viderman
Towards lower bounds on locally testable codes via density arguments. Comput. Complex. 21 (2) (2012)
Eli Ben-Sasson, Shachar Lovett, Noga Ron-Zewi
An Additive Combinatorics Approach Relating Rank to Communication Complexity. FOCS (2012)
Eli Ben-Sasson, Alessandro Chiesa, Daniel Genkin, Eran Tromer
Fast Reductions from RAMs to Delegatable Succinct Constraint Satisfaction Problems. IACR Cryptol. ePrint Arch. 2012 (2012)
Eli Ben-Sasson, Serge Fehr, Rafail Ostrovsky
Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority. CRYPTO (2012)
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
Sampling-based proofs of almost-periodicity results and algorithmic applications CoRR (2012)
Eli Ben-Sasson, Ariel Gabizon
Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic. APPROX-RANDOM (2012)
Eli Ben-Sasson, Ariel Gabizon, Yohay Kaplan, Swastik Kopparty, Shubhangi Saraf
A new family of locally correctable codes based on degree-lifted algebraic geometry codes. Electron. Colloquium Comput. Complex. 19 (2012)
Eli Ben-Sasson, Jan Johannsen
Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width. IJCAI (2011)
Eli Ben-Sasson, Madhu Sudan
Limits on the Rate of Locally Testable Affine-Invariant Codes. APPROX-RANDOM (2011)
Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan
On Sums of Locally Testable Affine Invariant Properties. APPROX-RANDOM (2011)
Eli Ben-Sasson, Michael Viderman
Composition of semi-LTCs by two-wise Tensor Products. Electron. Colloquium Comput. Complex. 18 (2011)

Eli Ben-Sasson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eli Ben-Sasson