Modeling and Monitoring Dynamic Dependency Environments. - Asaf Adi; Dagan Gilat; Royi Ronen; Ron Rothblum; Guy Sharon; Inna Skarbovsky (IEEE SCC, 2005)

Reactive Rules-Based Dependency Resolution for Monitoring Dynamic Environments. - Dagan Gilat; Royi Ronen; Ron Rothblum; Guy Sharon; Inna Skarbovsky (RuleML, 2005)

A Taxonomy of Enhanced Trapdoor Permutations. - Ron Rothblum (Electron. Colloquium Comput. Complex., 2010)

Homomorphic Encryption: from Private-Key to Public-Key. - Ron Rothblum (Electron. Colloquium Comput. Complex., 2010)

Enhancements of Trapdoor Permutations. - Oded Goldreich 001; Ron Rothblum (Electron. Colloquium Comput. Complex., 2011)

On the Circular Security of Bit-Encryption. - Ron Rothblum (IACR Cryptol. ePrint Arch., 2012)

Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). - Gil Cohen; Ivan Bjerre Damgård; Yuval Ishai; Jonas Kölker; Peter Bro Miltersen; Ran Raz; Ron D. Rothblum (CRYPTO (2), 2013)

Delegation for bounded space. - Yael Tauman Kalai; Ran Raz; Ron D. Rothblum (STOC, 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; Ron Rothblum (Electron. Colloquium Comput. Complex., 2013)

How to Delegate Computations: The Power of No-Signaling Proofs. - Yael Tauman Kalai; Ran Raz; Ron Rothblum (Electron. Colloquium Comput. Complex., 2013)

Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). - Raghu Meka; Omer Reingold; Guy N. Rothblum; Ron D. Rothblum (ICALP (1), 2014)

Pseudorandom Graphs in Data Structures. - Omer Reingold; Ron D. Rothblum; Udi Wieder (ICALP (1), 2014)

Arguments of Proximity - [Extended Abstract]. - Yael Tauman Kalai; Ron D. Rothblum (CRYPTO (2), 2015)

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract). - Oded Goldreich 001; Tom Gur; Ron D. Rothblum (ICALP (1), 2015)

Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs. - Oded Goldreich 001; Tom Gur; Ron Rothblum (Electron. Colloquium Comput. Complex., 2015)

Spooky Encryption and its Applications. - Yevgeniy Dodis; Shai Halevi; Ron D. Rothblum; Daniel Wichs (IACR Cryptol. ePrint Arch., 2016)

From Obfuscation to the Security of Fiat-Shamir for Proofs. - Yael Tauman Kalai; Guy N. Rothblum; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2016)

A Hierarchy Theorem for Interactive Proofs of Proximity. - Tom Gur; Ron D. Rothblum (ITCS, 2017)

Multi Collision Resistant Hash Functions and their Applications. - Itay Berman; Akshay Degwekar; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2017)

From Laconic Zero-Knowledge to Public-Key Cryptography. - Itay Berman; Akshay Degwekar; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2017)

Relaxed Locally Correctable Codes. - Tom Gur; Govind Ramnarayan; Ron Rothblum (Electron. Colloquium Comput. Complex., 2017)

Zero-Knowledge Proofs of Proximity. - Itay Berman; Ron D. Rothblum; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2017)

Distinguisher-Dependent Simulation in Two Rounds and its Applications. - Abhishek Jain 002; Yael Tauman Kalai; Dakshita Khurana; Ron Rothblum (IACR Cryptol. ePrint Arch., 2017)

From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. - Itay Berman; Akshay Degwekar; Ron D. Rothblum; Prashant Nalini Vasudevan (CRYPTO (3), 2018)

Non-interactive proofs of proximity. - Tom Gur; Ron D. Rothblum (Comput. Complex., 2018)

Delegating Computations with (almost) Minimal Time and Space Overhead. - Justin Holmgren; Ron Rothblum (Electron. Colloquium Comput. Complex., 2018)

Efficient Batch Verification for UP. - Omer Reingold; Guy N. Rothblum; Ron Rothblum (Electron. Colloquium Comput. Complex., 2018)

Fiat-Shamir From Simpler Assumptions. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Alex Lombardi; Guy N. Rothblum; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2018)

Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. - Ran Canetti; Yilei Chen 001; Leonid Reyzin; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2018)

Towards Non-Interactive Zero-Knowledge for NP from LWE. - Ron D. Rothblum; Adam Sealfon; Katerina Sotiraki (IACR Cryptol. ePrint Arch., 2018)

Fiat-Shamir: from practice to theory. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Alex Lombardi; Guy N. Rothblum; Ron D. Rothblum; Daniel Wichs (STOC, 2019)

Statistical Difference Beyond the Polarizing Regime. - Itay Berman; Akshay Degwekar; Ron D. Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2019)

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. - Lijie Chen 001; Ron Rothblum; Roei Tell; Eylon Yogev (Electron. Colloquium Comput. Complex., 2019)

Local Proofs Approaching the Witness Length. - Noga Ron-Zewi; Ron Rothblum (Electron. Colloquium Comput. Complex., 2019)

On the (In)security of Kilian-Based SNARGs. - James Bartusek; Liron Bronfman; Justin Holmgren; Fermi Ma; Ron Rothblum (IACR Cryptol. ePrint Arch., 2019)

New Constructions of Reusable Designated-Verifier NIZKs. - Alex Lombardi; Willy Quach; Ron D. Rothblum; Daniel Wichs; David J. Wu 001 (IACR Cryptol. ePrint Arch., 2019)

Reusable Designated-Verifier NIZKs for all NP from CDH. - Willy Quach; Ron D. Rothblum; Daniel Wichs (IACR Cryptol. ePrint Arch., 2019)

On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. - Lijie Chen 001; Ron D. Rothblum; Roei Tell; Eylon Yogev (FOCS, 2020)

Local Proofs Approaching the Witness Length [Extended Abstract]. - Noga Ron-Zewi; Ron D. Rothblum (FOCS, 2020)

Hard Properties with (Very) Short PCPPs and Their Applications. - Omri Ben-Eliezer; Eldar Fischer; Amit Levi; Ron D. Rothblum (ITCS, 2020)

Batch Verification for Statistical Zero Knowledge Proofs. - Inbar Kaslasi; Prashant Nalini Vasudevan; Guy N. Rothblum; Ron Rothblum; Adam Sealfon (Electron. Colloquium Comput. Complex., 2020)

Batch Verification and Proofs of Proximity with Polylog Overhead. - Guy N. Rothblum; Ron Rothblum (Electron. Colloquium Comput. Complex., 2020)

Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. - Alexander R. Block; Justin Holmgren; Alon Rosen; Ron D. Rothblum; Pratik Soni (IACR Cryptol. ePrint Arch., 2020)

An Exponential Separation Between MA and AM Proofs of Proximity. - Tom Gur; Yang P. Liu; Ron D. Rothblum (Comput. Complex., 2021)

PCPs and Instance Compression from a Cryptographic Lens. - Liron Bronfman; Ron Rothblum (Electron. Colloquium Comput. Complex., 2021)

Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge). - Justin Holmgren; Alex Lombardi; Ron Rothblum (Electron. Colloquium Comput. Complex., 2021)

Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers. - Inbar Kaslasi; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2021)

Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. - Noga Ron-Zewi; Ron Rothblum (Electron. Colloquium Comput. Complex., 2021)

Small Circuits Imply Efficient Arthur-Merlin Protocols. - Ron D. Rothblum; Michael Ezra (Electron. Colloquium Comput. Complex., 2021)

Time- and Space-Efficient Arguments from Groups of Unknown Order. - Alexander R. Block; Justin Holmgren; Alon Rosen; Ron D. Rothblum; Pratik Soni (IACR Cryptol. ePrint Arch., 2021)

Toward Non-interactive Zero-Knowledge Proofs for NP from LWE. - Ron D. Rothblum; Adam Sealfon; Katerina Sotiraki (J. Cryptol., 2021)

Constant-Round Interactive Proofs for Delegating Computation. - Omer Reingold; Guy N. Rothblum; Ron D. Rothblum (SIAM J. Comput., 2021)

Faster Sounder Succinct Arguments and sfIOPs. - Justin Holmgren; Ron D. Rothblum (CRYPTO (1), 2022)

Delegation for Search Problems. - Justin Holmgren; Andrea Lincoln; Ron D. Rothblum (ICALP, 2022)

Unstructured Hardness to Average-Case Randomness. - Lijie Chen 001; Ron D. Rothblum; Roei Tell (Electron. Colloquium Comput. Complex., 2022)

Collision-Resistance from Multi-Collision-Resistance. - Ron D. Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2022)

PPAD is as Hard as LWE and Iterated Squaring. - Nir Bitansky; Arka Rai Choudhuri; Justin Holmgren; Chethan Kamath; Alex Lombardi; Omer Paneth; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2022)

Faster Sounder Succinct Arguments and IOPs. - Justin Holmgren; Ron Rothblum (IACR Cryptol. ePrint Arch., 2022)

Succinct Interactive Oracle Proofs: Applications and Limitations. - Shafik Nassar; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2022)

Distribution-Free Proofs of Proximity. - Hugo Aaronson; Tom Gur; Ninad Rajgopal; Ron Rothblum (Electron. Colloquium Comput. Complex., 2023)

Batch Proofs are Statistically Hiding. - Nir Bitansky; Chethan Kamath; Omer Paneth; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2023)

Efficient Interactive Proofs for Non-Deterministic Bounded Space. - Joshua Cook; Ron D. Rothblum (Electron. Colloquium Comput. Complex., 2023)

Linear-Size Boolean Circuits for Multiselection. - Justin Holmgren; Ron Rothblum (Electron. Colloquium Comput. Complex., 2023)

Combinatorially Homomorphic Encryption. - Yuval Ishai; Eyal Kushnir; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2023)

Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). - Lijie Chen 001; Ron D. Rothblum; Roei Tell (Electron. Colloquium Comput. Complex., 2024)

Rate-1 Zero-Knowledge Proofs from One-Way Functions. - Noor Athamnah; Ron D. Rothblum; Eden Florentz-Konopnicki (Electron. Colloquium Comput. Complex., 2024)

Dot-Product Proofs and Their Applications. - Nir Bitansky; Ron D. Rothblum; Prahladh Harsha; Yuval Ishai; David J. Wu 001 (Electron. Colloquium Comput. Complex., 2024)

Zero-Knowledge in Streaming Interactive Proofs. - Tomer Gewirtzman; Ron Rothblum (Electron. Colloquium Comput. Complex., 2024)

Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. - Or Keret; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2024)

Locally Testable Tree Codes. - Tamer Mour; Alon Rosen; Ron Rothblum (Electron. Colloquium Comput. Complex., 2024)

Strong Batching for Non-Interactive Statistical Zero-Knowledge. - Changrui Mu; Shafik Nassar; Ron Rothblum; Prashant Nalini Vasudevan (Electron. Colloquium Comput. Complex., 2024)

Blaze: Fast SNARKs from Interleaved RAA Codes. - Martijn Brehm; Binyi Chen; Ben Fisch; Nicolas Resch; Ron D. Rothblum; Hadas Zeilberger (IACR Cryptol. ePrint Arch., 2024)

A Note on Efficient Computation of the Multilinear Extension. - Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2024)

Linear Prover IOPs in Log Star Rounds. - Noor Athamnah; Noga Ron-Zewi; Ron Rothblum (Electron. Colloquium Comput. Complex., 2025)

Tree PCPs. - Tamer Mour; Alon Rosen; Ron Rothblum (Electron. Colloquium Comput. Complex., 2025)

Jagged Polynomial Commitments (or: How to Stack Multilinears). - Tamir Hemo; Kevin Jue; Eugene Rabinovich; Gyumin Roh; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2025)

How to Prove False Statements: Practical Attacks on Fiat-Shamir. - Dmitry Khovratovich; Ron D. Rothblum; Lev Soukhanov (IACR Cryptol. ePrint Arch., 2025)