Ron D. Rothblum

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 85

Top Topics

Extended Abstract

Top Venues

IACR Cryptol. ePrint Arch.

Electron. Colloquium Comput. Complex.

Publications

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