Ron Rothblum
Email:
Homepage:
Phone:
[email protected]
http://people.csail.mit.edu/ronr/
+1 (650) 7414549
Research Interests
Theoretical computer science, especially foundations of cryptography and complexity theory.
Education
2011 - 2015
Ph.D. in Computer Science
Weizmann Institute, Rehovot, Israel
Thesis title: Verifiable Outsourcing of Computation
Advisor: Prof. Oded Goldreich
2008 - 2010
M.Sc. in Computer Science
Weizmann Institute, Rehovot, Israel
Thesis title: On Homomorphic Encryption and Enhanced Trapdoor Permutations
Advisor: Prof. Oded Goldreich
2000 - 2003
B.A. in Computer Science, Summa Cum Laude (96/100 GPA)
The Open University, Israel
Employment
2015 - Current
Postdoctoral Associate at MIT (Cambridge, MA)
Host: Prof. Shafi Goldwasser
Summer 2015
Research Fellow at the Simons Institute (Berkeley, CA)
Special summer program on Cryptography
Summer 2013
Intern at Microsoft Research (Silicon Valley Campus)
Mentor: Prof. Omer Reingold
Summer 2011
Intern at Microsoft Research (New England)
Mentor: Dr. Yael Kalai
2009 - 2015
Teaching Assistant at the Weizmann Institute (Rehovot, Israel)
Computational Complexity
Foundations of Cryptography
Number Theoretic and Algebraic Cryptography
1
2003 - 2008
Israel Defense Forces
Cyber security R&D.
2002 - 2003
IBM Research (Haifa, Israel)
Student Researcher
Awards and Honors
The John F. Kennedy Ph.D. Distinction Prize, 2015. The Weizmann Institute of Science.
The Shimon Even Prize in Theoretical Computer Science, 2014. Faculty of Mathematics
and Computer Science, the Weizmann Institute of Science.
Invited to China Theory Week 2014 (declined).
The Otto Schwartz Award for Outstanding Students, 2013. Feinberg Graduate School of
the Weizmann Institute of Science.
The Dean’s Prize for M.Sc. students in Recognition of Academic Excellence and Scientific
Accomplishments, 2010. Feinberg Graduate School of the Weizmann Institute of Science.
Unit Commander’s (equivalent of General) award for creative thinking, 2008. Israel Defense Forces,
2000, 2001, 2002, 2003 - Awards for Distinction in Academic Accomplishments. The Open
University.
Publications
(In reverse chronological order)
1. Gap-CVP is Complete for Constructing NIZKs from LWE. Ron D. Rothblum, Adam
Sealfon and Katerina Sotiraki. In Submission.
2. Itay Berman, Akshay Degwekar, Ron D. Rothblum and Prashant Nalini Vasudevan. Multi
Collision Resistant Hash Functions and their Applications. In Submission.
3. Justin Holmgren and Ron D. Rothblum. Delegating Computations with (almost) Minimal
Overhead. In Submission.
4. Itay Berman, Akshay Degwekar, Ron D. Rothblum and Prashant Nalini Vasudevan. From
Laconic Zero-Knowledge to Public-Key Cryptography. In Submission.
5. Tom Gur, Govind Ramnarayan and Ron D. Rothblum. Relaxed Locally Correctable
Codes. In Submission.
6. Itay Berman, Ron D. Rothblum and Vinod Vaikuntanathan. Zero-Knowledge Proofs of
Proximity. In Submission.
7. Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana and Ron D. Rothblum. DistinguisherDependent Simulation in Two Rounds and its Applications. Accepted to Crypto 2017.
8. Yael Tauman Kalai, Guy N. Rothblum and Ron D. Rothblum. From Obfuscation to the
Security of Fiat-Shamir for Proofs. Accepted to Crypto 2017.
2
9. Tom Gur and Ron D. Rothblum. A Hierarchy Theorem for Interactive Proofs of Proximity.
8th Innovations in Theoretical Computer Science Conference (ITCS) 2017.
10. Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum and Daniel Wichs. Spooky Encryption
and its Applications. 36rd Annual Cryptology Conference (CRYPTO) 2016.
11. Omer Reingold, Guy N. Rothblum and Ron D. Rothblum. Constant-Round Interactive
Proofs for Delegating Computation. 48th ACM Symposium on Theory of Computing
(STOC) 2016.
Invited to a special issue of the SIAM Journal on Computing dedicated to the
best papers of STOC’16.
12. Yael Tauman Kalai and Ron D. Rothblum. Arguments of Proximity. 35rd Annual Cryptology Conference (CRYPTO) 2015.
13. Oded Goldreich, Tom Gur and Ron D. Rothblum. Proofs of Proximity for Context-Free
Languages and Read-Once Branching Programs. 42nd International Colloquium on Automata, Languages, and Programming (ICALP) 2015.
Invited to a special issue of ”Information and Computation” devoted to selected papers from ICALP 2015.
14. Tom Gur, Ron D. Rothblum. Non-Interactive Proofs of Proximity. 6th Innovations in
Theoretical Computer Science Conference (ITCS), 2015. To appear in Computational
Complexity.
15. Omer Reingold, Ron D. Rothblum, Udi Wieder. Pseudorandom Graphs in Data Structures. 41st International Colloquium on Automata, Languages, and Programming (ICALP),
2014.
16. Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum. Fast Pseudorandomness for Independence and Load Balancing. 41st International Colloquium on Automata,
Languages, and Programming (ICALP), 2014.
17. Yael Tauman Kalai, Ran Raz, Ron D. Rothblum. How to Delegate Computations: The
Power of No-Signaling Proofs. 46th ACM Symposium on Theory of Computing (STOC)
2014.
Accepted to J. ACM. Also invited to a special issue of the SIAM Journal on
Computing dedicated to the best papers of STOC’14 (declined).
18. 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.
33rd Annual Cryptology Conference (CRYPTO) 2013.
19. Yael Tauman Kalai, Ran Raz, Ron D. Rothblum. Delegation for Bounded Space. 45th
ACM Symposium on Theory of Computing (STOC) 2013.
20. Ron D. Rothblum. On the Circular Security of Bit-Encryption. 10th Theory of Cryptography Conference (TCC) 2013.
21. Oded Goldreich and Ron D. Rothblum. Enhancements of Trapdoor Permutations. Journal of Cryptology, 2013 .
22. Ron Rothblum. Homomorphic Encryption: from Private-Key to Public-Key. 8th Theory
of Cryptography Conference (TCC) 2011.
3
23. Ron Rothblum. A Taxonomy of Enhanced Trapdoor Permutations. Electronic Colloquium
on Computational Complexity (ECCC) 2010.
24. Dagan Gilat, Royi Ronen, Ron Rothblum, Guy Sharon and Inna Skarbovsky. Reactive Rules-Based Dependency Resolution for Monitoring Dynamic Environments. RuleML
2005.
25. Asaf Adi, Dagan Gilat, Royi Ronen, Ron Rothblum, Guy Sharon and Inna Skarbovsky.
Modeling and Monitoring Dynamic Dependency Environments. IEEE SCC 2005.
Professional Activities
Program committee member of TCC 2017.
Reviewer: Asiacrypt 2011, Crypto 2013, STOC 2014, ITCS 2014, TCC 2015, Eurocrypt
2015, Crypto 2015, TCC 2016-A, CCC 2016, TCC 2016-B, ITCS 2017, Crypto 2017,
FOCS 2017.
Co-organizer of Charles River Crypto Day, 2016-2017.
Co-organizer of MIT Cryptography and Beyond Seminar, Summer 2016.
Patents
Asaf Adi, Dagan Gilat, Royi Ronen, Ron David Rothblum, Guy Sharon, Inna Skarbovsky.
Device, method and computer program product for monitoring a group of entities. United
States Patent Application 20070124324 (Pending).
Talks
Recent Progress on Doubly Efficient Interactive Proofs
– Invited Speaker for STOC 2017 workshop on “Probabilistically checkable and interactive proofs (PCP/IP): between theory and practice”, to be held in Montreal in
June 2017.
Spooky Encryption and its Applications
– MIT Cryptography and Information Security (CIS) Seminar, 2016.
– Oberwolfach Cryptography Workshop, 2017.
Constant-Round Interactive Proofs for Delegating Computation
– Oberwolfach Complexity Workshop, 2015.
– Institute for Advanced Studies (IAS) Complexity Seminar, 2016.
– Charles River Crypto Day, 2016 (at MSR New England).
– Harvard, MIT and MSR joint Theory Seminar, 2016 (at Harvard).
– DIMACS Workshop on Cryptography and its Interactions: Learning Theory, Coding
Theory, and Data Structures, 2016.
4
Proofs and Arguments of Proximity: Verifying Computations in Sub-linear Time
– New York Area Crypto Day, 2015 (at Columbia University).
– Charles River Crypto Day, 2015 (at MIT).
Arguments of Proximity
– Oberwolfach Cryptography Workshop, 2014.
– Tel-Aviv University Theory Seminar, 2015.
Fast Pseudorandomness for Independence and Load Balancing
– Tel-Aviv University, Algorithms Seminar, 2014.
How to Delegate Computations: The Power of No-Signaling Proofs
– ICORE day at Hebrew University of Jerusalem, 2013.
– Tel-Aviv University Cryptography Seminar, 2014.
– Oberwolfach Cryptography Workshop, 2014.
– Weizmann Institute Theory Seminar, 2014.
– Oberwolfach Complexity Workshop, 2015.
Delegation for Bounded Space
– IDC Cryptography Seminar, 2013.
Efficient Multiparty Protocols via Log-Depth Threshold Formulae
– New York Area Crypto day, 2013.
– Securing Computation Workshop at the Simons Institute (Berkeley, CA), 2015.
On the Circular Security of Bit-Encryption
– Tel-Aviv University Cryptography Seminar, 2012.
A Taxonomy of Enhanced Trapdoor Permutations
– Bar-Ilan University Cryptography Seminar, 2012.
Homomorphic Encryption: from Private-Key to Public-Key
– MIT Cryptography and Information Security (CIS) Seminar, 2011.
– Tel-Aviv University Cryptography Seminar, 2011.
– Technion Theory Seminar, 2012.
Additional
Dual U.S. and Israeli citizenship. Fluent in English and Hebrew.
5