Ron Rothblum
Ron D. Rothblum
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2018
- [j2]Tom Gur, Ron D. Rothblum:
Non-interactive proofs of proximity. Computational Complexity 27(1): 99-207 (2018) - [c21]Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum:
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. EUROCRYPT (1) 2018: 91-122 - [c20]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi-Collision Resistant Hash Functions and Their Applications. EUROCRYPT (2) 2018: 133-161 - [c19]Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan:
Zero-Knowledge Proofs of Proximity. ITCS 2018: 19:1-19:20 - [c18]Tom Gur, Govind Ramnarayan, Ron D. Rothblum:
Relaxed Locally Correctable Codes. ITCS 2018: 27:1-27:11 - [i22]Omer Reingold, Guy N. Rothblum, Ron Rothblum:
Efficient Batch Verification for UP. Electronic Colloquium on Computational Complexity (ECCC) 25: 22 (2018) - [i21]Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum:
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. IACR Cryptology ePrint Archive 2018: 131 (2018) - [i20]Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki:
Towards Non-Interactive Zero-Knowledge for NP from LWE. IACR Cryptology ePrint Archive 2018: 240 (2018) - 2017
- [c17]Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Ron Rothblum:
Distinguisher-Dependent Simulation in Two Rounds and its Applications. CRYPTO (2) 2017: 158-189 - [c16]Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum:
From Obfuscation to the Security of Fiat-Shamir for Proofs. CRYPTO (2) 2017: 224-251 - [c15]
- [i19]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. Electronic Colloquium on Computational Complexity (ECCC) 24: 97 (2017) - [i18]Tom Gur, Govind Ramnarayan, Ron Rothblum:
Relaxed Locally Correctable Codes. Electronic Colloquium on Computational Complexity (ECCC) 24: 143 (2017) - [i17]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography. Electronic Colloquium on Computational Complexity (ECCC) 24: 172 (2017) - [i16]Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan:
Zero-Knowledge Proofs of Proximity. IACR Cryptology ePrint Archive 2017: 114 (2017) - [i15]Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Ron Rothblum:
Distinguisher-Dependent Simulation in Two Rounds and its Applications. IACR Cryptology ePrint Archive 2017: 330 (2017) - [i14]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. IACR Cryptology ePrint Archive 2017: 489 (2017) - 2016
- [c14]Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs:
Spooky Encryption and Its Applications. CRYPTO (3) 2016: 93-122 - [c13]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Constant-round interactive proofs for delegating computation. STOC 2016: 49-62 - [i13]Omer Reingold, Ron Rothblum, Guy N. Rothblum:
Constant-Round Interactive Proofs for Delegating Computation. Electronic Colloquium on Computational Complexity (ECCC) 23: 61 (2016) - [i12]Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs:
Spooky Encryption and its Applications. IACR Cryptology ePrint Archive 2016: 272 (2016) - [i11]Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum:
From Obfuscation to the Security of Fiat-Shamir for Proofs. IACR Cryptology ePrint Archive 2016: 303 (2016) - 2015
- [c12]Yael Tauman Kalai, Ron D. Rothblum:
Arguments of Proximity - [Extended Abstract]. CRYPTO (2) 2015: 422-442 - [c11]Oded Goldreich, Tom Gur, Ron D. Rothblum:
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs - (Extended Abstract). ICALP (1) 2015: 666-677 - [c10]
- [i10]Oded Goldreich, Tom Gur, Ron Rothblum:
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 22: 24 (2015) - 2014
- [c9]Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). ICALP (1) 2014: 859-870 - [c8]Omer Reingold, Ron D. Rothblum, Udi Wieder:
Pseudorandom Graphs in Data Structures. ICALP (1) 2014: 943-954 - [c7]Yael Tauman Kalai, Ran Raz, Ron D. Rothblum:
How to delegate computations: the power of no-signaling proofs. STOC 2014: 485-494 - 2013
- [j1]Oded Goldreich, Ron D. Rothblum:
Enhancements of Trapdoor Permutations. J. Cryptology 26(3): 484-512 (2013) - [c6]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 - (Extended Abstract). CRYPTO (2) 2013: 185-202 - [c5]
- [c4]
- [i9]Tom Gur, Ron Rothblum:
Non-Interactive Proofs of Proximity. Electronic Colloquium on Computational Complexity (ECCC) 20: 78 (2013) - [i8]Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron Rothblum:
Efficient Multiparty Protocols via Log-Depth Threshold Formulae. Electronic Colloquium on Computational Complexity (ECCC) 20: 107 (2013) - [i7]Yael Tauman Kalai, Ran Raz, Ron Rothblum:
How to Delegate Computations: The Power of No-Signaling Proofs. Electronic Colloquium on Computational Complexity (ECCC) 20: 183 (2013) - [i6]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. IACR Cryptology ePrint Archive 2013: 480 (2013) - [i5]Yael Tauman Kalai, Ran Raz, Ron Rothblum:
How to Delegate Computations: The Power of No-Signaling Proofs. IACR Cryptology ePrint Archive 2013: 862 (2013) - 2012
- [i4]Ron Rothblum:
On the Circular Security of Bit-Encryption. IACR Cryptology ePrint Archive 2012: 102 (2012) - 2011
- [c3]
- [i3]Oded Goldreich, Ron Rothblum:
Enhancements of Trapdoor Permutations. Electronic Colloquium on Computational Complexity (ECCC) 18: 159 (2011) - 2010
- [i2]Ron Rothblum:
A Taxonomy of Enhanced Trapdoor Permutations. Electronic Colloquium on Computational Complexity (ECCC) 17: 145 (2010) - [i1]Ron Rothblum:
Homomorphic Encryption: from Private-Key to Public-Key. Electronic Colloquium on Computational Complexity (ECCC) 17: 146 (2010)
2000 – 2009
- 2005
- [c2]Asaf Adi, Dagan Gilat, Royi Ronen, Ron Rothblum, Guy Sharon, Inna Skarbovsky:
Modeling and Monitoring Dynamic Dependency Environments. IEEE SCC 2005: 208-216 - [c1]Dagan Gilat, Royi Ronen, Ron Rothblum, Guy Sharon, Inna Skarbovsky:
Reactive Rules-Based Dependency Resolution for Monitoring Dynamic Environments. RuleML 2005: 71-83
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-04-17 22:26 CEST by the dblp team