Ron Rothblum

About me

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!

Current Students: Noor Athamnah, Tomer Gewirtzman, Or Keret, Eyal Kushnir and Kirill Kutsenok

Former Students: Liron Bronfman, Michael Ezra, Inbar Kaslasi and Shafik Nassar

Papers

In Submission

• Blaze: Fast SNARKs from Interleaved RAA Codes
  Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum and Hadas Zeilberger
  Available at [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
  Available at [ECCC]
  

Publications

• Locally Testable Tree Codes
  Tamer Mour, Alon Rosen, Ron D. Rothblum
  SODA 2025
  Available at [ECCC]
• Doubly-Efficient Batch Verification in Statistical Zero-Knowledge
  Or Keret, Ron D. Rothblum and Prashant Nalini Vasudevan
  TCC 2024
  Available at [ECCC] or at [ePrint]
• Rate-1 Zero-Knowledge Proofs from One-Way Functions
  Noor Athamnah, Eden Florentz - Konopnicki, Ron D. Rothblum
  TCC 2024
  Available at [ECCC] or at [ePrint]
• Dot-Product Proofs and Their Applications
  Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum and David J. Wu
  FOCS 2024
  Available at [ECCC] and [ePrint]
  
• Distribution-Free Proofs of Proximity
  Hugo Aaronson, Tom Gur, Ninad Rajgopal and Ron D. Rothblum
  CCC 2024
  Available at [ECCC]
  
• Linear-Size Circuits for Multiselection
  Justin Holmgren and Ron D. Rothblum
  CCC 2024
  Available at [ECCC]
  
• Batch Proofs are Statistically Hiding
  Nir Bitansky, Chetan Kamath, Omer Paneth, Ron D. Rothblum and Prashant Nalini Vadusevan
  STOC 2024
  Available at [ECCC] or at [ePrint]
  
• Strong Batching for Non-Interactive Statistical Zero-Knowledge
  Changrui Mu, Shafik Nassar, Ron D. Rothblum and Prashant Nalini Vasudevan
  Eurocrypt 2024
  Available at [ECCC] or at [ePrint]
• Combinatorially Homomorphic Encryption
  Yuval Ishai, Eyal Kushnir, and Ron D. Rothblum
  TCC 2023
  Available at [ePrint]
• Efficient Interactive Proofs for Non-Deterministic Bounded Space
  Joshua Cook and Ron D. Rothblum
  RANDOM 2023
  Available at [ECCC]
• 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
  Available at [ePrint]
• Unstructured Hardness to Average-Case Randomness
  Lijie Chen, Ron D. Rothblum and Roei Tell
  FOCS 2022
  Available at [ECCC]
• Collision-Resistance from Multi-Collision-Resistance
  Ron D. Rothblum and Prashant Nalini Vasudevan
  Crypto 2022
  Available at [ECCC] or at [ePrint]
• Succinct Interactive Oracle Proofs: Applications and Limitations
  Shafik Nassar and Ron D. Rothblumn
  Crypto 2022
  Available at [ePrint]
• Faster Sounder Succinct Arguments and IOPs
  Justin Holmgren and Ron D. Rothblumn
  Crypto 2022
  Available at [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
  Available at [ECCC] or at [ePrint]
• PCPs and Instance Compression from a Cryptographic Lens
  Liron Bronfman and Ron D. Rothblum
  ITCS 2022
  Available at [ECCC] or at [ePrint]
• Small Circuits Imply Efficient Arthur-Merlin Protocols
  Michael Ezra and Ron D. Rothblum
  ITCS 2022
  Available at [ECCC]
• 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
  Available at [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
  Available at [ECCC] or at [ePrint]
• Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers
  Inbar Kaslasi, Ron D. Rothblum and Prashant Nalini Vasudevan
  Eurocrypt 2021
  Available at [ECCC] or at [ePrint]
• Batch Verification for Statistical Zero Knowledge Proofs
  Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon and Prashant Nalini Vasudevan
  TCC 2020
  Available at [ECCC] or at [ePrint]
• Batch Verification and Proofs of Proximity with Polylog Overhead
  Guy N. Rothblum and Ron D. Rothblum
  TCC 2020
  Available at [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
  Available at [ePrint]
• On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds
  Lijie Chen, Ron D. Rothblum, Roei Tell and Eylon Yogev
  FOCS 2020
  Available at [ECCC]
• Local Proofs Approaching the Witness Length
  Noga Ron-Zewi and Ron D. Rothblum
  FOCS 2020
  Available at [ECCC] or at [ePrint]
• Hard Properties with (very) Short PCPPs and their Applications
  Omri Ben-Eliezer, Eldar Fischer, Amit Levi and Ron D. Rothblum
  ITCS 2020
  Available at [arXiv]
• On the (In)security of Kilian-Based SNARGs
  James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma and Ron D. Rothblum
  TCC 2019
  Available at [ePrint]
• Statistical Difference Beyond the Polarizing Regime
  Itay Berman, Akshay Degwekar, Ron D. Rothblum and Prashant Nalini Vasudevan
  TCC 2019
  Available at [ECCC]
• New Constructions of Reusable Designated-Verifier NIZKs
  Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs and David Wu
  Crypto 2019
  Available at [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
  (Merge of [CCHLRR] and [CLW])
• Reusable Designated-Verifier NIZKs for all NP from CDH
  Willy Quach, Ron D. Rothblum and Daniel Wichs
  Eurocrypt 2019
  Available at [ePrint]
• Towards Non-Interactive Zero-Knowledge for NP from LWE
  Ron D. Rothblum, Adam Sealfon and Katerina Sotiraki
  PKC 2019, also invited to Journal of Cryptology
  Available at [ePrint]
• Delegating Computations with (almost) Minimal Time and Space Overhead
  Justin Holmgren and Ron D. Rothblum
  FOCS 2018
  Available at [ECCC] and [ePrint]
• From Laconic Zero-Knowledge to Public-Key Cryptography
  Itay Berman, Akshay Degwekar, Ron D. Rothblum and Prashant Nalini Vasudevan
  CRYPTO 2018
  Available at [ECCC] and [ePrint]
• An Exponential Separation Between MA and AM Proofs of Proximity
  Tom Gur, Yang P. Liu and Ron D. Rothblum
  ICALP 2018
  Available at [ECCC]
• Efficient Batch Verification for UP
  Omer Reingold, Guy N. Rothblum and Ron D. Rothblum
  CCC 2018
  Available at [ECCC]
• Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption
  Ran Canetti, Yilei Chen, Leonid Reyzin and Ron D. Rothblum
  Eurocrypt 2018
  Available at [ePrint]
• Multi Collision Resistant Hash Functions and their Applications
  Itay Berman, Akshay Degwekar, Ron D. Rothblum and Prashant Nalini Vasudevan
  Eurocrypt 2018
  Available at [ECCC] or [ePrint]
• Zero-Knowledge Proofs of Proximity
  Itay Berman, Ron D. Rothblum and Vinod Vaikuntanathan
  ITCS 2018
  Available at [ePrint]
• Relaxed Locally Correctable Codes
  Tom Gur, Govind Ramnarayan and Ron D. Rothblum
  ITCS 2018
  Available at [ECCC]
• From Obfuscation to the Security of Fiat-Shamir for Proofs
  Yael Tauman Kalai, Guy N. Rothblum and Ron D. Rothblum
  Crypto 2017
  Available at [ePrint]
• Distinguisher-Dependent Simulation in Two Rounds and its Applications
  Abhishek Jain and Yael Tauman Kalai and Dakshita Khurana and Ron D. Rothblum
  Crypto 2017
  Available at [ePrint]
• A Hierarchy Theorem for Interactive Proofs of Proximity
  Tom Gur and Ron D. Rothblum
  ITCS 2017
  
• Spooky Encryption and its Applications
  Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum and Daniel Wichs
  Crypto 2016
  Available at [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)
  Available at [ECCC]
• 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)
  Available at [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
  Available at [ECCC]
• 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))
  Available at [ECCC] or [ePrint]
• 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
  Available at [ECCC] or [ePrint]
• Delegation for Bounded Space
  Yael Tauman Kalai, Ran Raz and Ron D. Rothblum
  STOC 2013
  Available at [ECCC] or [ePrint]
• On the Circular Security of Bit-Encryption
  Ron D. Rothblum
  TCC 2013
  Available at [ePrint]
• Enhancements of Trapdoor Permutations
  Oded Goldreich and Ron D. Rothblum
  Journal of Cryptology, 2013
  Available at [ECCC]
• Homomorphic Encryption: from Private-Key to Public-Key
  Ron Rothblum
  TCC 2011
  Available at [ECCC]

Technical Reports

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