Noga Ron-Zewi

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 57

Top Topics

Public Key Encryption

Query Complexity

Top Venues

Electron. Colloquium Comput. Complex.

IEEE Trans. Inf. Theory

SIAM J. Comput.

Publications

Noga Ron-Zewi, Mor Weiss
Zero-knowledge IOPs Approaching Witness Length. IACR Cryptol. ePrint Arch. 2024 (2024)
Noga Ron-Zewi, S. Venkitesh, Mary Wootters
Efficient List-decoding of Polynomial Ideal Codes with Optimal List Size. CoRR (2024)
Noga Ron-Zewi, Mor Weiss
Zero-Knowledge IOPs Approaching Witness Length. CRYPTO (10) (2024)
Noga Ron-Zewi, Ron Rothblum
Local Proofs Approaching the Witness Length. J. ACM 71 (3) (2024)
Elie Abboud, Noga Ron-Zewi
Finer-Grained Reductions in Fine-Grained Hardness of Approximation. ICALP (2024)
Elie Abboud, Noga Ron-Zewi
Finer-grained Reductions in Fine-grained Hardness of Approximation. CoRR (2023)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
Improved List Decoding of Folded Reed-Solomon and Multiplicity Codes. SIAM J. Comput. 52 (3) (2023)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. Electron. Colloquium Comput. Complex. (2023)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
Simple Constructions of Unique Neighbor Expanders from Error-correcting Codes. CoRR (2023)
Arkadev Chattopadhyay, Marek Cygan, Noga Ron-Zewi, Christian Wulff-Nilsen
Special Section on the Fifty-Second Annual ACM Symposium on the Theory of Computing (STOC 2020). SIAM J. Comput. 51 (3) (2022)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
From Local to Robust Testing via Agreement Testing. Theory Comput. 18 (2022)
Zeyu Guo, Noga Ron-Zewi
Efficient List-Decoding With Constant Alphabet and List Sizes. IEEE Trans. Inf. Theory 68 (3) (2022)
Noga Ron-Zewi, Ron D. Rothblum
Proving as fast as computing: succinct arguments with constant prover overhead. STOC (2022)
Noga Ron-Zewi, Mary Wootters, Gilles Zémor
Linear-Time Erasure List-Decoding of Expander Codes. IEEE Trans. Inf. Theory 67 (9) (2021)
Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma
Query Complexity Lower Bounds for Local List-Decoding and Hard-Core Predicates (Even for Small Rate and Huge Lists). ITCS (2021)
Noga Ron-Zewi, Ron D. Rothblum
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. IACR Cryptol. ePrint Arch. 2021 (2021)
Noga Ron-Zewi, Ivona Bezáková, László A. Végh
Special Issue: APPROX-RANDOM 2019: Guest Editors' Foreword. Theory Comput. 17 (2021)
Zeyu Guo, Noga Ron-Zewi
Efficient list-decoding with constant alphabet and list sizes. STOC (2021)
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
On List Recovery of High-Rate Tensor Codes. IEEE Trans. Inf. Theory 67 (1) (2021)
Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma
Erasures versus errors in local decoding and property testing. Random Struct. Algorithms 59 (4) (2021)
Noga Ron-Zewi, Ron Rothblum
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. Electron. Colloquium Comput. Complex. 28 (2021)
Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
Locally testable codes via high-dimensional expanders. Electron. Colloquium Comput. Complex. 27 (2020)
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
Local List Recovery of High-Rate Tensor Codes and Applications. SIAM J. Comput. 49 (4) (2020)
Zeyu Guo, Noga Ron-Zewi
Efficient List-Decoding with Constant Alphabet and List Sizes. Electron. Colloquium Comput. Complex. 27 (2020)
Noga Ron-Zewi, Ronen Shaltiel, Nithin Varma
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists). Electron. Colloquium Comput. Complex. 27 (2020)
Noga Ron-Zewi, Ron D. Rothblum
Local Proofs Approaching the Witness Length [Extended Abstract]. FOCS (2020)
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
LDPC Codes Achieve List Decoding Capacity. FOCS (2020)
Noga Ron-Zewi, Mary Wootters, Gilles Zémor
Linear-time Erasure List-decoding of Expander Codes. Electron. Colloquium Comput. Complex. 27 (2020)
Noga Ron-Zewi, Mary Wootters, Gilles Zémor
Linear-time Erasure List-decoding of Expander Codes. ISIT (2020)
Zeyu Guo, Noga Ron-Zewi
Efficient List-Decoding with Constant Alphabet and List Sizes. CoRR (2020)
Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
Locally testable codes via high-dimensional expanders. CoRR (2020)
Noga Ron-Zewi, Mary Wootters, Gilles Zémor
Linear-time Erasure List-decoding of Expander Codes. CoRR (2020)
Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma
Erasures vs. Errors in Local Decoding and Property Testing. ITCS (2019)
Noga Ron-Zewi, Ron D. Rothblum
Local Proofs Approaching the Witness Length. IACR Cryptol. ePrint Arch. 2019 (2019)
Noga Ron-Zewi, Ron Rothblum
Local Proofs Approaching the Witness Length. Electron. Colloquium Comput. Complex. 26 (2019)
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
LDPC Codes Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. 26 (2019)
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
On List Recovery of High-Rate Tensor Codes. Electron. Colloquium Comput. Complex. 26 (2019)
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
LDPC Codes Achieve List Decoding Capacity. CoRR (2019)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
From Local to Robust Testing via Agreement Testing. ITCS (2019)
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
On List Recovery of High-Rate Tensor Codes. APPROX-RANDOM (2019)
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound. IEEE Trans. Inf. Theory 64 (8) (2018)
Irit Dinur, Tali Kaufman, Noga Ron-Zewi
From Local to Robust Testing via Agreement Testing. Electron. Colloquium Comput. Complex. 25 (2018)
Sofya Raskhodnikova, Noga Ron-Zewi, Nithin Varma
Erasures versus Errors in Local Decoding and Property Testing. Electron. Colloquium Comput. Complex. 25 (2018)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. CoRR (2018)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
Improved Decoding of Folded Reed-Solomon and Multiplicity Codes. FOCS (2018)
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson
Explicit Capacity Approaching Coding for Interactive Communication. IEEE Trans. Inf. Theory 64 (10) (2018)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, Mary Wootters
Improved decoding of Folded Reed-Solomon and Multiplicity Codes. Electron. Colloquium Comput. Complex. 25 (2018)
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
Local List Recovery of High-rate Tensor Codes & Applications. Electron. Colloquium Comput. Complex. 24 (2017)
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
Local List Recovery of High-rate Tensor Codes and Applications. CoRR (2017)
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity. J. ACM 64 (2) (2017)
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
Sparse affine-invariant linear codes are locally testable. Comput. Complex. 26 (1) (2017)
Brett Hemenway, Noga Ron-Zewi, Mary Wootters
Local List Recovery of High-Rate Tensor Codes & Applications. FOCS (2017)
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound. SODA (2017)
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity. STOC (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)
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson
Towards Optimal Deterministic Coding for Interactive Communication. SODA (2016)
Sivakanth Gopi, Swastik Kopparty, Rafael Mendes de Oliveira, Noga Ron-Zewi, Shubhangi Saraf
Locally testable and Locally correctable Codes Approaching the Gilbert-Varshamov Bound. Electron. Colloquium Comput. Complex. 23 (2016)
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
Space Complexity in Polynomial Calculus. SIAM J. Comput. 44 (4) (2015)
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
High-rate Locally-testable Codes with Quasi-polylogarithmic Query Complexity. Electron. Colloquium Comput. Complex. 22 (2015)
Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. Electron. Colloquium Comput. Complex. 22 (2015)
Swastik Kopparty, Or Meir, Noga Ron-Zewi, Shubhangi Saraf
High rate locally-correctable and locally-testable codes with sub-polynomial query complexity. CoRR (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)
Ran Gelles, Bernhard Haeupler, Gillat Kol, Noga Ron-Zewi, Avi Wigderson
Towards Optimal Deterministic Coding for Interactive Communication. Electron. Colloquium Comput. Complex. 22 (2015)
Elad Haramaty, Noga Ron-Zewi, Madhu Sudan
Absolutely Sound Testing of Lifted Codes. Theory Comput. 11 (2015)
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, Shachar Lovett, Noga Ron-Zewi
An Additive Combinatorics Approach Relating Rank to Communication Complexity. J. ACM 61 (4) (2014)
Elad Haramaty, Noga Ron-Zewi, Madhu Sudan
Absolutely Sound Testing of Lifted Codes. APPROX-RANDOM (2013)
Elad Haramaty, Noga Ron-Zewi, Madhu Sudan
Absolutely Sound Testing of Lifted Codes. Electron. Colloquium Comput. Complex. 20 (2013)
Noga Ron-Zewi, Madhu Sudan
A New Upper Bound on the Query Complexity of Testing Generalized Reed-Muller Codes. Theory Comput. 9 (2013)
Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan
Sparse Affine-Invariant Linear Codes Are Locally Testable. FOCS (2012)
Noga Ron-Zewi, Madhu Sudan
A new upper bound on the query complexity for testing generalized Reed-Muller codes CoRR (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)
Noga Ron-Zewi, Madhu Sudan
A New Upper Bound on the Query Complexity for Testing Generalized Reed-Muller codes. APPROX-RANDOM (2012)
Yuval Filmus, Massimo Lauria, Jakob Nordström, Noga Ron-Zewi, Neil Thapen
Space Complexity in Polynomial Calculus. 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, Shachar Lovett, Noga Ron-Zewi
An Additive Combinatorics Approach Relating Rank to Communication Complexity. FOCS (2012)
Eli Ben-Sasson, Noga Ron-Zewi, Madhur Tulsiani, Julia Wolf
Sampling-based proofs of almost-periodicity results and algorithmic applications CoRR (2012)
Yuval Filmus, Massimo Lauria, Jakob Nordström, Neil Thapen, Noga Ron-Zewi
Space Complexity in Polynomial Calculus. Computational Complexity Conference (2012)