Ron Rothblum

About

I am an Associate Professor at the Faculty of Computer Science at the Technion. Prior to that I was a postdoc at MIT (2015–2018) and Northeastern University (2017–2018). I completed my PhD at the Weizmann Institute, where I was extremely fortunate to have been advised by Prof. Oded Goldreich.

I am interested in theoretical computer science at large and especially in cryptography and complexity theory.

My brother Guy also does Crypto!

Papers

In Submission

• VEIL: Lightweight Zero-Knowledge for Hash-Based Multilinear Proof Systems
  Rahul Dalal, Tamir Hemo, Eugene Rabinovich and Ron D. Rothblum
  ePrint
• Tree PCPs
  Tamer Mour, Alon Rosen, Ron D. Rothblum
  ECCC ePrint

Publications

2026

• Bolt: Faster SNARKs from Sketched Codes
  Kobi Gurkan, Andrija Novakovic and Ron D. Rothblum
  Crypto 2026
  ePrint
• TensorSwitch: Nearly Optimal Polynomial Commitments from Tensor Codes
  Benedikt Bünz, Giacomo Fenzi, Ron D. Rothblum and William Wang
  Crypto 2026
  ePrint
• Succinct Zero-knowledge Proofs from One-way Functions: The Blackbox Way
  Eden Florentz-Konopnicki and Ron D. Rothblum
  Crypto 2026
  ECCC ePrint
• Jagged Polynomial Commitments (or: How to Stack Multilinears)
  Tamir Hemo, Kevin Jue, Eugene Rabinovich, Gyumin Roh and Ron D. Rothblum
  Eurocrypt 2026
  ePrint

2025

• Linear Prover IOPs in Log Star Rounds
  Noor Athamnah, Noga Ron-Zewi and Ron D. Rothblum
  TCC 2025
  ECCC ePrint
• How to Prove False Statements: Practical Attacks on Fiat-Shamir
  Dmitry Khovratovich, Ron D. Rothblum and Lev Soukhanov
  CRYPTO 2025
  ePrint
  Featured on Quanta Magazine
• Zero-Knowledge in Streaming Interactive Proofs
  Tomer Gewirtzman and Ron D. Rothblum
  CRYPTO 2025
  ECCC
• Blaze: Fast SNARKs from Interleaved RAA Codes
  Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum and Hadas Zeilberger
  Eurocrypt 2025
  ePrint
• Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?)
  Lijie Chen, Ron D. Rothblum and Roei Tell
  STOC 2025
  ECCC
• Locally Testable Tree Codes
  Tamer Mour, Alon Rosen, Ron D. Rothblum
  SODA 2025
  ECCC

2024

• Doubly-Efficient Batch Verification in Statistical Zero-Knowledge
  Or Keret, Ron D. Rothblum and Prashant Nalini Vasudevan
  TCC 2024
  ECCC ePrint
• Rate-1 Zero-Knowledge Proofs from One-Way Functions
  Noor Athamnah, Eden Florentz-Konopnicki, Ron D. Rothblum
  TCC 2024
  ECCC ePrint
• Dot-Product Proofs and Their Applications
  Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum and David J. Wu
  FOCS 2024 · Journal Version: invited to SICOMP, 2024
  ECCC ePrint
• Distribution-Free Proofs of Proximity
  Hugo Aaronson, Tom Gur, Ninad Rajgopal and Ron D. Rothblum
  CCC 2024
  ECCC
• Linear-Size Circuits for Multiselection
  Justin Holmgren and Ron D. Rothblum
  CCC 2024
  ECCC
• Batch Proofs are Statistically Hiding
  Nir Bitansky, Chetan Kamath, Omer Paneth, Ron D. Rothblum and Prashant Nalini Vasudevan
  STOC 2024
  ECCC ePrint
• Strong Batching for Non-Interactive Statistical Zero-Knowledge
  Changrui Mu, Shafik Nassar, Ron D. Rothblum and Prashant Nalini Vasudevan
  Eurocrypt 2024
  ECCC ePrint

2023

• Combinatorially Homomorphic Encryption
  Yuval Ishai, Eyal Kushnir, and Ron D. Rothblum
  TCC 2023
  ePrint
• Efficient Interactive Proofs for Non-Deterministic Bounded Space
  Joshua Cook and Ron D. Rothblum
  RANDOM 2023
  ECCC

2022

• PPAD is as Hard as LWE and Iterated Squaring
  Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth and Ron D. Rothblum
  TCC 2022
  ePrint
• Unstructured Hardness to Average-Case Randomness
  Lijie Chen, Ron D. Rothblum and Roei Tell
  FOCS 2022
  ECCC
• Collision-Resistance from Multi-Collision-Resistance
  Ron D. Rothblum and Prashant Nalini Vasudevan
  Crypto 2022 · Journal Version: invited to Journal of Cryptology 2022
  ECCC ePrint
• Succinct Interactive Oracle Proofs: Applications and Limitations
  Shafik Nassar and Ron D. Rothblum
  Crypto 2022
  ePrint
• Faster Sounder Succinct Arguments and IOPs
  Justin Holmgren and Ron D. Rothblum
  Crypto 2022
  ePrint
• Delegation for Search Problems
  Justin Holmgren, Andrea Lincoln and Ron D. Rothblum
  ICALP 2022
• Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead
  Noga Ron-Zewi and Ron D. Rothblum
  STOC 2022 · Journal Version: JACM 2025
  ECCC ePrint
• PCPs and Instance Compression from a Cryptographic Lens
  Liron Bronfman and Ron D. Rothblum
  ITCS 2022
  ECCC ePrint
• Small Circuits Imply Efficient Arthur-Merlin Protocols
  Michael Ezra and Ron D. Rothblum
  ITCS 2022
  ECCC

2021

• Time- and Space-Efficient Arguments from Groups of Unknown Order
  Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum and Pratik Soni
  Crypto 2021
  ePrint
• Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge)
  Justin Holmgren, Alex Lombardi and Ron D. Rothblum
  STOC 2021
  ECCC ePrint
• Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers
  Inbar Kaslasi, Ron D. Rothblum and Prashant Nalini Vasudevan
  Eurocrypt 2021
  ECCC ePrint

2020

• Batch Verification for Statistical Zero Knowledge Proofs
  Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon and Prashant Nalini Vasudevan
  TCC 2020
  ECCC ePrint
• Batch Verification and Proofs of Proximity with Polylog Overhead
  Guy N. Rothblum and Ron D. Rothblum
  TCC 2020
  ECCC
• Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overhead
  Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum and Pratik Soni
  TCC 2020
  ePrint
• On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds
  Lijie Chen, Ron D. Rothblum, Roei Tell and Eylon Yogev
  FOCS 2020 · Journal Version: JACM 2023
  ECCC
• Local Proofs Approaching the Witness Length
  Noga Ron-Zewi and Ron D. Rothblum
  FOCS 2020 · Journal Version: JACM 2024
  ECCC ePrint
• Hard Properties with (very) Short PCPPs and their Applications
  Omri Ben-Eliezer, Eldar Fischer, Amit Levi and Ron D. Rothblum
  ITCS 2020
  arXiv

2019

• On the (In)security of Kilian-Based SNARGs
  James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma and Ron D. Rothblum
  TCC 2019
  ePrint
• Statistical Difference Beyond the Polarizing Regime
  Itay Berman, Akshay Degwekar, Ron D. Rothblum and Prashant Nalini Vasudevan
  TCC 2019
  ECCC
• New Constructions of Reusable Designated-Verifier NIZKs
  Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs and David Wu
  Crypto 2019
  ePrint
• Fiat-Shamir: from Practice to Theory
  Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum and Daniel Wichs
  STOC 2019
  CCHLRR CLW
  Merge of CCHLRR and CLW
• Reusable Designated-Verifier NIZKs for all NP from CDH
  Willy Quach, Ron D. Rothblum and Daniel Wichs
  Eurocrypt 2019
  ePrint
• Towards Non-Interactive Zero-Knowledge for NP from LWE
  Ron D. Rothblum, Adam Sealfon and Katerina Sotiraki
  PKC 2019 · Journal Version: invited to Journal of Cryptology, 2021
  ePrint

2018

• Delegating Computations with (almost) Minimal Time and Space Overhead
  Justin Holmgren and Ron D. Rothblum
  FOCS 2018
  ECCC ePrint
• From Laconic Zero-Knowledge to Public-Key Cryptography
  Itay Berman, Akshay Degwekar, Ron D. Rothblum and Prashant Nalini Vasudevan
  CRYPTO 2018
  ECCC ePrint
• An Exponential Separation Between MA and AM Proofs of Proximity
  Tom Gur, Yang P. Liu and Ron D. Rothblum
  ICALP 2018
  ECCC
• Efficient Batch Verification for UP
  Omer Reingold, Guy N. Rothblum and Ron D. Rothblum
  CCC 2018
  ECCC
• Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption
  Ran Canetti, Yilei Chen, Leonid Reyzin and Ron D. Rothblum
  Eurocrypt 2018
  ePrint
• Multi Collision Resistant Hash Functions and their Applications
  Itay Berman, Akshay Degwekar, Ron D. Rothblum and Prashant Nalini Vasudevan
  Eurocrypt 2018
  ECCC ePrint
• Zero-Knowledge Proofs of Proximity
  Itay Berman, Ron D. Rothblum and Vinod Vaikuntanathan
  ITCS 2018
  ePrint
• Relaxed Locally Correctable Codes
  Tom Gur, Govind Ramnarayan and Ron D. Rothblum
  ITCS 2018 · Journal Version: Theory of Computing, 2020
  ECCC

2017

• From Obfuscation to the Security of Fiat-Shamir for Proofs
  Yael Tauman Kalai, Guy N. Rothblum and Ron D. Rothblum
  Crypto 2017
  ePrint
• Distinguisher-Dependent Simulation in Two Rounds and its Applications
  Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana and Ron D. Rothblum
  Crypto 2017
  ePrint
• A Hierarchy Theorem for Interactive Proofs of Proximity
  Tom Gur and Ron D. Rothblum
  ITCS 2017

2016

• Spooky Encryption and its Applications
  Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum and Daniel Wichs
  Crypto 2016
  ePrint
• Constant-Round Interactive Proofs for Delegating Computation
  Omer Reingold, Guy N. Rothblum and Ron D. Rothblum
  STOC 2016 · Invited to STOC 2016 Special Issue
  ECCC

2015

• Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
  Oded Goldreich, Tom Gur and Ron D. Rothblum
  ICALP 2015 · Invited to the ICALP 2015 Special Issue
  ECCC
• Arguments of Proximity
  Yael Tauman Kalai and Ron D. Rothblum
  Crypto 2015
• Non-interactive Proofs of Proximity
  Tom Gur and Ron D. Rothblum
  ITCS 2015 · Journal Version: Computational Complexity 2016
  ECCC

2014

• Pseudorandom Graphs in Data Structures
  Omer Reingold, Ron D. Rothblum and Udi Wieder
  ICALP 2014
• Fast Pseudorandomness for Independence and Load Balancing
  Raghu Meka, Omer Reingold, Guy N. Rothblum, and Ron D. Rothblum
  ICALP 2014
• How to Delegate Computations: The Power of No-Signaling Proofs
  Yael Tauman Kalai, Ran Raz and Ron D. Rothblum
  STOC 2014 · Journal Version: JACM 2022 (also invited to STOC 2014 Special Issue, declined)
  ECCC ePrint

2013

• Efficient Multiparty Protocols via Log-Depth Threshold Formulae
  Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz and Ron D. Rothblum
  Crypto 2013
  ECCC ePrint
• Delegation for Bounded Space
  Yael Tauman Kalai, Ran Raz and Ron D. Rothblum
  STOC 2013
  ECCC ePrint
• On the Circular Security of Bit-Encryption
  Ron D. Rothblum
  TCC 2013
  ePrint
• Enhancements of Trapdoor Permutations
  Oded Goldreich and Ron D. Rothblum
  Journal of Cryptology, 2013
  ECCC

2011

• Homomorphic Encryption: from Private-Key to Public-Key
  Ron Rothblum
  TCC 2011
  ECCC

Technical Reports

• A Note on Efficient Computation of the Multilinear Extension
  Ron D. Rothblum
  ePrint
• A Taxonomy of Enhanced Trapdoor Permutations
  Ron Rothblum
  ECCC