Ron D. Rothblum

112 papers A* 14A 10Journal 57Unranked 31
YearRankTypeTitle / Venue / Authors
2026 J jnl
Bolt: Faster SNARKs from Sketched Codes.
IACR Cryptol. ePrint Arch.
Kobi Gurkan, Andrija Novakovic, Ron D. Rothblum
2025 — conf
Blaze: Fast SNARKs from Interleaved RAA Codes.
EUROCRYPT (4)
Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger
2025 A* conf
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?).
STOC
Lijie Chen, Ron D. Rothblum, Roei Tell
2025 — conf
How to Prove False Statements: Practical Attacks on Fiat-Shamir.
CRYPTO (6)
Dmitry Khovratovich, Ron D. Rothblum, Lev Soukhanov
2025 J jnl
How to Prove False Statements: Practical Attacks on Fiat-Shamir.
IACR Cryptol. ePrint Arch.
Dmitry Khovratovich, Ron D. Rothblum, Lev Soukhanov
2025 J jnl
Jagged Polynomial Commitments (or: How to Stack Multilinears).
IACR Cryptol. ePrint Arch.
Tamir Hemo, Kevin Jue, Eugene Rabinovich, Gyumin Roh, Ron D. Rothblum
2025 — conf
Linear Prover IOPs in Log Star Rounds.
TCC (1)
Noor Athamnah, Noga Ron-Zewi, Ron D. Rothblum
2025 J jnl
Linear Prover IOPs in Log Star Rounds.
IACR Cryptol. ePrint Arch.
Noor Athamnah, Noga Ron-Zewi, Ron D. Rothblum
2025 J jnl
Succinct Zero-knowledge Proofs from One-way Functions: The Blackbox Way.
Electron. Colloquium Comput. Complex.
Ron D. Rothblum, Eden Florentz-Konopnicki
2025 J jnl
Succinct Zero-knowledge Proofs from One-way Functions:The Blackbox Way.
IACR Cryptol. ePrint Arch.
Eden Florentz-Konopnicki, Ron D. Rothblum
2025 J jnl
TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes.
IACR Cryptol. ePrint Arch.
Benedikt Bünz, Giacomo Fenzi, Ron D. Rothblum, William Wang
2024 J jnl
A Note on Efficient Computation of the Multilinear Extension.
IACR Cryptol. ePrint Arch.
Ron D. Rothblum
2024 A* conf
Batch Proofs Are Statistically Hiding.
STOC
Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan
2024 J jnl
Blaze: Fast SNARKs from Interleaved RAA Codes.
IACR Cryptol. ePrint Arch.
Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger
2024 J jnl
Collision Resistance from Multi-collision Resistance.
J. Cryptol.
Ron D. Rothblum, Prashant Nalini Vasudevan
2024 A conf
Distribution-Free Proofs of Proximity.
CCC
Hugo Aaronson, Tom Gur, Ninad Rajgopal, Ron D. Rothblum
2024 A* conf
Dot-Product Proofs and Their Applications.
FOCS
Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu
2024 J jnl
Dot-Product Proofs and Their Applications.
Electron. Colloquium Comput. Complex.
Nir Bitansky, Ron D. Rothblum, Prahladh Harsha, Yuval Ishai, David J. Wu
2024 J jnl
Dot-Product Proofs and Their Applications.
IACR Cryptol. ePrint Arch.
Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu
2024 — conf
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge.
TCC (2)
Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan
2024 J jnl
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge.
IACR Cryptol. ePrint Arch.
Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan
2024 J jnl
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?).
Electron. Colloquium Comput. Complex.
Lijie Chen, Ron D. Rothblum, Roei Tell
2024 — conf
Rate-1 Zero-Knowledge Proofs from One-Way Functions.
TCC (1)
Noor Athamnah, Eden Florentz-Konopnicki, Ron D. Rothblum
2024 J jnl
Rate-1 Zero-Knowledge Proofs from One-Way Functions.
Electron. Colloquium Comput. Complex.
Noor Athamnah, Ron D. Rothblum, Eden Florentz-Konopnicki
2024 J jnl
Rate-1 Zero-Knowledge Proofs from One-Way Functions.
IACR Cryptol. ePrint Arch.
Noor Athamnah, Eden Florentz-Konopnicki, Ron D. Rothblum
2024 J jnl
Strong Batching for Non-Interactive Statistical Zero-Knowledge.
IACR Cryptol. ePrint Arch.
Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan
2024 — conf
Strong Batching for Non-interactive Statistical Zero-Knowledge.
EUROCRYPT (6)
Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan
2023 — conf
Combinatorially Homomorphic Encryption.
TCC (2)
Yuval Ishai, Eyal Kushnir, Ron D. Rothblum
2023 J jnl
Combinatorially Homomorphic Encryption.
IACR Cryptol. ePrint Arch.
Yuval Ishai, Eyal Kushnir, Ron D. Rothblum
2023 J jnl
Distribution-Free Proofs of Proximity.
CoRR
Hugo Aaronson, Tom Gur, Ninad Rajgopal, Ron D. Rothblum
2023 A conf
Efficient Interactive Proofs for Non-Deterministic Bounded Space.
APPROX/RANDOM
Joshua Cook, Ron D. Rothblum
2023 J jnl
Efficient Interactive Proofs for Non-Deterministic Bounded Space.
Electron. Colloquium Comput. Complex.
Joshua Cook, Ron D. Rothblum
2023 J jnl
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds.
J. ACM
Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
2022 — conf
Collision-Resistance from Multi-Collision-Resistance.
CRYPTO (3)
Ron D. Rothblum, Prashant Nalini Vasudevan
2022 J jnl
Collision-Resistance from Multi-Collision-Resistance.
Electron. Colloquium Comput. Complex.
Ron D. Rothblum, Prashant Nalini Vasudevan
2022 J jnl
Collision-Resistance from Multi-Collision-Resistance.
IACR Cryptol. ePrint Arch.
Ron D. Rothblum, Prashant Nalini Vasudevan
2022 A* conf
Delegation for Search Problems.
ICALP
Justin Holmgren, Andrea Lincoln, Ron D. Rothblum
2022 — conf
Faster Sounder Succinct Arguments and sfIOPs.
CRYPTO (1)
Justin Holmgren, Ron D. Rothblum
2022 J jnl
How to Delegate Computations: The Power of No-Signaling Proofs.
J. ACM
Yael Tauman Kalai, Ran Raz, Ron D. Rothblum
2022 A conf
PCPs and Instance Compression from a Cryptographic Lens.
ITCS
Liron Bronfman, Ron D. Rothblum
2022 — conf
PPAD is as Hard as LWE and Iterated Squaring.
TCC (2)
Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum
2022 J jnl
PPAD is as Hard as LWE and Iterated Squaring.
IACR Cryptol. ePrint Arch.
Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum
2022 A* conf
Proving as fast as computing: succinct arguments with constant prover overhead.
STOC
Noga Ron-Zewi, Ron D. Rothblum
2022 A conf
Small Circuits Imply Efficient Arthur-Merlin Protocols.
ITCS
Michael Ezra, Ron D. Rothblum
2022 — conf
Succinct Interactive Oracle Proofs: Applications and Limitations.
CRYPTO (1)
Shafik Nassar, Ron D. Rothblum
2022 J jnl
Succinct Interactive Oracle Proofs: Applications and Limitations.
IACR Cryptol. ePrint Arch.
Shafik Nassar, Ron D. Rothblum
2022 A* conf
Unstructured Hardness to Average-Case Randomness.
FOCS
Lijie Chen, Ron D. Rothblum, Roei Tell
2022 J jnl
Unstructured Hardness to Average-Case Randomness.
Electron. Colloquium Comput. Complex.
Lijie Chen, Ron D. Rothblum, Roei Tell
2021 J jnl
An Exponential Separation Between MA and AM Proofs of Proximity.
Comput. Complex.
Tom Gur, Yang P. Liu, Ron D. Rothblum
2021 J jnl
Constant-Round Interactive Proofs for Delegating Computation.
SIAM J. Comput.
Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2021 J jnl
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge).
IACR Cryptol. ePrint Arch.
Justin Holmgren, Alex Lombardi, Ron D. Rothblum
2021 A* conf
Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge).
STOC
Justin Holmgren, Alex Lombardi, Ron D. Rothblum
2021 J jnl
PCPs and Instance Compression from a Cryptographic Lens.
IACR Cryptol. ePrint Arch.
Liron Bronfman, Ron D. Rothblum
2021 J jnl
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead.
IACR Cryptol. ePrint Arch.
Noga Ron-Zewi, Ron D. Rothblum
2021 — conf
Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers.
EUROCRYPT (3)
Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan
2021 J jnl
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers.
IACR Cryptol. ePrint Arch.
Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan
2021 J jnl
Small Circuits Imply Efficient Arthur-Merlin Protocols.
Electron. Colloquium Comput. Complex.
Ron D. Rothblum, Michael Ezra
2021 — conf
Time- and Space-Efficient Arguments from Groups of Unknown Order.
CRYPTO (4)
Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni
2021 J jnl
Time- and Space-Efficient Arguments from Groups of Unknown Order.
IACR Cryptol. ePrint Arch.
Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni
2021 J jnl
Toward Non-interactive Zero-Knowledge Proofs for NP from LWE.
J. Cryptol.
Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki
2020 — conf
Batch Verification and Proofs of Proximity with Polylog Overhead.
TCC (2)
Guy N. Rothblum, Ron D. Rothblum
2020 — conf
Batch Verification for Statistical Zero Knowledge Proofs.
TCC (2)
Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
2020 J jnl
Batch Verification for Statistical Zero Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
2020 A conf
Hard Properties with (Very) Short PCPPs and Their Applications.
ITCS
Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum
2020 A* conf
Local Proofs Approaching the Witness Length [Extended Abstract].
FOCS
Noga Ron-Zewi, Ron D. Rothblum
2020 A* conf
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract.
FOCS
Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev
2020 — conf
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.
TCC (2)
Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni
2020 J jnl
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads.
IACR Cryptol. ePrint Arch.
Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni
2019 A* conf
Fiat-Shamir: from practice to theory.
STOC
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs
2019 J jnl
Hard properties with (very) short PCPPs and their applications.
CoRR
Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum
2019 J jnl
Local Proofs Approaching the Witness Length.
IACR Cryptol. ePrint Arch.
Noga Ron-Zewi, Ron D. Rothblum
2019 — conf
New Constructions of Reusable Designated-Verifier NIZKs.
CRYPTO (3)
Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu
2019 J jnl
New Constructions of Reusable Designated-Verifier NIZKs.
IACR Cryptol. ePrint Arch.
Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu
2019 — conf
On the (In)security of Kilian-Based SNARGs.
TCC (2)
James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum
2019 — conf
Reusable Designated-Verifier NIZKs for all NP from CDH.
EUROCRYPT (2)
Willy Quach, Ron D. Rothblum, Daniel Wichs
2019 J jnl
Reusable Designated-Verifier NIZKs for all NP from CDH.
IACR Cryptol. ePrint Arch.
Willy Quach, Ron D. Rothblum, Daniel Wichs
2019 — conf
Statistical Difference Beyond the Polarizing Regime.
TCC (2)
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
2019 J jnl
Statistical Difference Beyond the Polarizing Regime.
Electron. Colloquium Comput. Complex.
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
2019 — conf
Towards Non-Interactive Zero-Knowledge for NP from LWE.
Public Key Cryptography (2)
Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki
2018 A* conf
An Exponential Separation Between MA and AM Proofs of Proximity.
ICALP
Tom Gur, Yang P. Liu, Ron D. Rothblum
2018 J jnl
An Exponential Separation Between MA and AM Proofs of Proximity.
Electron. Colloquium Comput. Complex.
Tom Gur, Yang P. Liu, Ron D. Rothblum
2018 J jnl
Delegating Computations with (almost) Minimal Time and Space Overhead.
IACR Cryptol. ePrint Arch.
Justin Holmgren, Ron D. Rothblum
2018 A conf
Efficient Batch Verification for UP.
CCC
Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2018 J jnl
Fiat-Shamir From Simpler Assumptions.
IACR Cryptol. ePrint Arch.
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum
2018 — conf
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption.
EUROCRYPT (1)
Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum
2018 J jnl
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption.
IACR Cryptol. ePrint Arch.
Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum
2018 — conf
From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract.
CRYPTO (3)
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
2018 J jnl
From Laconic Zero-Knowledge to Public-Key Cryptography.
IACR Cryptol. ePrint Arch.
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
2018 — conf
Multi-Collision Resistant Hash Functions and Their Applications.
EUROCRYPT (2)
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
2018 J jnl
Non-interactive proofs of proximity.
Comput. Complex.
Tom Gur, Ron D. Rothblum
2018 J jnl
Proofs of proximity for context-free languages and read-once branching programs.
Inf. Comput.
Oded Goldreich, Tom Gur, Ron D. Rothblum
2018 A conf
Relaxed Locally Correctable Codes.
ITCS
Tom Gur, Govind Ramnarayan, Ron D. Rothblum
2018 J jnl
Towards Non-Interactive Zero-Knowledge for NP from LWE.
IACR Cryptol. ePrint Arch.
Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki
2018 A conf
Zero-Knowledge Proofs of Proximity.
ITCS
Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan
2017 A conf
A Hierarchy Theorem for Interactive Proofs of Proximity.
ITCS
Tom Gur, Ron D. Rothblum
2017 — conf
From Obfuscation to the Security of Fiat-Shamir for Proofs.
CRYPTO (2)
Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum
2017 J jnl
Multi Collision Resistant Hash Functions and their Applications.
IACR Cryptol. ePrint Arch.
Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan
2017 J jnl
Zero-Knowledge Proofs of Proximity.
IACR Cryptol. ePrint Arch.
Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan
2016 A* conf
Constant-round interactive proofs for delegating computation.
STOC
Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2016 J jnl
From Obfuscation to the Security of Fiat-Shamir for Proofs.
IACR Cryptol. ePrint Arch.
Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum
2016 — conf
Spooky Encryption and Its Applications.
CRYPTO (3)
Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs
2016 J jnl
Spooky Encryption and its Applications.
IACR Cryptol. ePrint Arch.
Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs
2015 — conf
Arguments of Proximity - [Extended Abstract].
CRYPTO (2)
Yael Tauman Kalai, Ron D. Rothblum
2015 A conf
Non-Interactive Proofs of Proximity.
ITCS
Tom Gur, Ron D. Rothblum
2015 — conf
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract).
ICALP (1)
Oded Goldreich, Tom Gur, Ron D. Rothblum
2014 — conf
Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract).
ICALP (1)
Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2014 A* conf
How to delegate computations: the power of no-signaling proofs.
STOC
Yael Tauman Kalai, Ran Raz, Ron D. Rothblum
2014 — conf
Pseudorandom Graphs in Data Structures.
ICALP (1)
Omer Reingold, Ron D. Rothblum, Udi Wieder
2013 A* conf
Delegation for bounded space.
STOC
Yael Tauman Kalai, Ran Raz, Ron D. Rothblum
2013 — conf
Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract).
CRYPTO (2)
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
2013 J jnl
Efficient Multiparty Protocols via Log-Depth Threshold Formulae.
IACR Cryptol. ePrint Arch.
Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
2013 J jnl
Enhancements of Trapdoor Permutations.
J. Cryptol.
Oded Goldreich, Ron D. Rothblum