Ron Rothblum


Ron Rothblum

About me


I am a Postdoctoral Associate at MIT, hosted by Prof. Shafi Goldwasser. Previously, 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!

My CV is available here.

Publications:

  • Relaxed Locally Correctable Codes
    Tom Gur, Govind Ramnarayan and Ron D. Rothblum.
    In Submission.
  • Zero-Knowledge Proofs of Proximity
    Itay Berman, Ron D. Rothblum and Vinod Vaikuntanathan
    In Submission.
    Available at [ePrint]
  • From Obfuscation to the Security of Fiat-Shamir for Proofs
    Yael Tauman Kalai, Guy N. Rothblum and Ron D. Rothblum
    In Submission
    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 (to appear in Computational Complexity)
    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 (Invited to STOC 2014 Special Issue (declined), to appear in JACM)
    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]
  • A Taxonomy of Enhanced Trapdoor Permutations
    Ron Rothblum
    ECCC 2010
    Available at [ECCC]
Some older publications