default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRon Rothblum
Ron D. Rothblum
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j11]Noga Ron-Zewi
, Ron Rothblum:
Local Proofs Approaching the Witness Length. J. ACM 71(3): 18 (2024)- [j10]Ron D. Rothblum, Prashant Nalini Vasudevan:
Collision Resistance from Multi-collision Resistance. J. Cryptol. 37(2): 14 (2024) - [c55]Justin Holmgren, Ron Rothblum:
Linear-Size Boolean Circuits for Multiselection. CCC 2024: 11:1-11:20 - [c54]Hugo Aaronson, Tom Gur, Ninad Rajgopal, Ron D. Rothblum:
Distribution-Free Proofs of Proximity. CCC 2024: 24:1-24:18 - [c53]Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Strong Batching for Non-interactive Statistical Zero-Knowledge. EUROCRYPT (6) 2024: 241-270 - [c52]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron D. Rothblum, Prashant Nalini Vasudevan:
Batch Proofs Are Statistically Hiding. STOC 2024: 435-443 - [i74]Lijie Chen, Ron D. Rothblum, Roei Tell:
Fiat-Shamir in the Plain Model from Derandomization (Or: Do Efficient Algorithms Believe that NP = PSPACE?). Electron. Colloquium Comput. Complex. TR24 (2024) - [i73]Noor Athamnah, Ron D. Rothblum, Eden Florentz-Konopnicki:
Rate-1 Zero-Knowledge Proofs from One-Way Functions. Electron. Colloquium Comput. Complex. TR24 (2024) - [i72]Nir Bitansky, Ron D. Rothblum, Prahladh Harsha, Yuval Ishai, David J. Wu:
Dot-Product Proofs and Their Applications. Electron. Colloquium Comput. Complex. TR24 (2024) - [i71]Or Keret, Ron Rothblum, Prashant Nalini Vasudevan:
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. Electron. Colloquium Comput. Complex. TR24 (2024) - [i70]Tamer Mour, Alon Rosen, Ron Rothblum:
Locally Testable Tree Codes. Electron. Colloquium Comput. Complex. TR24 (2024) - [i69]Changrui Mu, Shafik Nassar, Ron Rothblum, Prashant Nalini Vasudevan:
Strong Batching for Non-Interactive Statistical Zero-Knowledge. Electron. Colloquium Comput. Complex. TR24 (2024) - [i68]Changrui Mu, Shafik Nassar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Strong Batching for Non-Interactive Statistical Zero-Knowledge. IACR Cryptol. ePrint Arch. 2024: 229 (2024) - [i67]Or Keret, Ron D. Rothblum, Prashant Nalini Vasudevan:
Doubly-Efficient Batch Verification in Statistical Zero-Knowledge. IACR Cryptol. ePrint Arch. 2024: 781 (2024) - [i66]Ron D. Rothblum:
A Note on Efficient Computation of the Multilinear Extension. IACR Cryptol. ePrint Arch. 2024: 1103 (2024) - [i65]Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu:
Dot-Product Proofs and Their Applications. IACR Cryptol. ePrint Arch. 2024: 1138 (2024) - [i64]Noor Athamnah, Eden Florentz-Konopnicki, Ron D. Rothblum:
Rate-1 Zero-Knowledge Proofs from One-Way Functions. IACR Cryptol. ePrint Arch. 2024: 1493 (2024) - [i63]Martijn Brehm, Binyi Chen, Ben Fisch, Nicolas Resch, Ron D. Rothblum, Hadas Zeilberger:
Blaze: Fast SNARKs from Interleaved RAA Codes. IACR Cryptol. ePrint Arch. 2024: 1609 (2024) - 2023
- [j9]Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
On Exponential-time Hypotheses, Derandomization, and Circuit Lower Bounds. J. ACM 70(4): 25:1-25:62 (2023) - [c51]Joshua Cook, Ron D. Rothblum:
Efficient Interactive Proofs for Non-Deterministic Bounded Space. APPROX/RANDOM 2023: 47:1-47:22 - [c50]Yuval Ishai, Eyal Kushnir, Ron D. Rothblum:
Combinatorially Homomorphic Encryption. TCC (2) 2023: 251-278 - [i62]Hugo Aaronson, Tom Gur, Ninad Rajgopal, Ron D. Rothblum:
Distribution-Free Proofs of Proximity. CoRR abs/2308.08874 (2023) - [i61]Hugo Aaronson, Tom Gur, Ninad Rajgopal, Ron Rothblum:
Distribution-Free Proofs of Proximity. Electron. Colloquium Comput. Complex. TR23 (2023) - [i60]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. Electron. Colloquium Comput. Complex. TR23 (2023) - [i59]Joshua Cook, Ron D. Rothblum:
Efficient Interactive Proofs for Non-Deterministic Bounded Space. Electron. Colloquium Comput. Complex. TR23 (2023) - [i58]Justin Holmgren, Ron Rothblum:
Linear-Size Boolean Circuits for Multiselection. Electron. Colloquium Comput. Complex. TR23 (2023) - [i57]Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan:
Batch Proofs are Statistically Hiding. IACR Cryptol. ePrint Arch. 2023: 754 (2023) - [i56]Yuval Ishai, Eyal Kushnir, Ron D. Rothblum:
Combinatorially Homomorphic Encryption. IACR Cryptol. ePrint Arch. 2023: 1973 (2023) - 2022
- [j8]Yael Tauman Kalai, Ran Raz, Ron D. Rothblum:
How to Delegate Computations: The Power of No-Signaling Proofs. J. ACM 69(1): 1:1-1:82 (2022) - [c49]Justin Holmgren, Ron D. Rothblum:
Faster Sounder Succinct Arguments and sfIOPs. CRYPTO (1) 2022: 474-503 - [c48]Ron D. Rothblum, Prashant Nalini Vasudevan:
Collision-Resistance from Multi-Collision-Resistance. CRYPTO (3) 2022: 503-529 - [c47]Shafik Nassar, Ron D. Rothblum:
Succinct Interactive Oracle Proofs: Applications and Limitations. CRYPTO (1) 2022: 504-532 - [c46]Lijie Chen, Ron D. Rothblum, Roei Tell:
Unstructured Hardness to Average-Case Randomness. FOCS 2022: 429-437 - [c45]Justin Holmgren, Andrea Lincoln, Ron D. Rothblum:
Delegation for Search Problems. ICALP 2022: 73:1-73:18 - [c44]Liron Bronfman, Ron D. Rothblum:
PCPs and Instance Compression from a Cryptographic Lens. ITCS 2022: 30:1-30:19 - [c43]Michael Ezra, Ron D. Rothblum:
Small Circuits Imply Efficient Arthur-Merlin Protocols. ITCS 2022: 67:1-67:16 - [c42]Noga Ron-Zewi, Ron D. Rothblum:
Proving as fast as computing: succinct arguments with constant prover overhead. STOC 2022: 1353-1363 - [c41]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum:
PPAD is as Hard as LWE and Iterated Squaring. TCC (2) 2022: 593-622 - [i55]Lijie Chen, Ron D. Rothblum, Roei Tell:
Unstructured Hardness to Average-Case Randomness. Electron. Colloquium Comput. Complex. TR22 (2022) - [i54]Ron D. Rothblum, Prashant Nalini Vasudevan:
Collision-Resistance from Multi-Collision-Resistance. Electron. Colloquium Comput. Complex. TR22 (2022) - [i53]Ron D. Rothblum, Prashant Nalini Vasudevan:
Collision-Resistance from Multi-Collision-Resistance. IACR Cryptol. ePrint Arch. 2022: 173 (2022) - [i52]Shafik Nassar, Ron D. Rothblum:
Succinct Interactive Oracle Proofs: Applications and Limitations. IACR Cryptol. ePrint Arch. 2022: 281 (2022) - [i51]Justin Holmgren, Ron Rothblum:
Faster Sounder Succinct Arguments and IOPs. IACR Cryptol. ePrint Arch. 2022: 994 (2022) - [i50]Nir Bitansky, Arka Rai Choudhuri, Justin Holmgren, Chethan Kamath, Alex Lombardi, Omer Paneth, Ron D. Rothblum:
PPAD is as Hard as LWE and Iterated Squaring. IACR Cryptol. ePrint Arch. 2022: 1272 (2022) - 2021
- [j7]Tom Gur, Yang P. Liu, Ron D. Rothblum:
An Exponential Separation Between MA and AM Proofs of Proximity. Comput. Complex. 30(2): 12 (2021) - [j6]Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki:
Toward Non-interactive Zero-Knowledge Proofs for NP from LWE. J. Cryptol. 34(1): 3 (2021) - [j5]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Constant-Round Interactive Proofs for Delegating Computation. SIAM J. Comput. 50(3) (2021) - [c40]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Time- and Space-Efficient Arguments from Groups of Unknown Order. CRYPTO (4) 2021: 123-152 - [c39]Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan:
Public-Coin Statistical Zero-Knowledge Batch Verification Against Malicious Verifiers. EUROCRYPT (3) 2021: 219-246 - [c38]Justin Holmgren, Alex Lombardi, Ron D. Rothblum:
Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge). STOC 2021: 750-760 - [i49]Liron Bronfman, Ron Rothblum:
PCPs and Instance Compression from a Cryptographic Lens. Electron. Colloquium Comput. Complex. TR21 (2021) - [i48]Justin Holmgren, Alex Lombardi, Ron Rothblum:
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge). Electron. Colloquium Comput. Complex. TR21 (2021) - [i47]Inbar Kaslasi, Ron Rothblum, Prashant Nalini Vasudevan:
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers. Electron. Colloquium Comput. Complex. TR21 (2021) - [i46]Noga Ron-Zewi, Ron Rothblum:
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. Electron. Colloquium Comput. Complex. TR21 (2021) - [i45]Ron D. Rothblum, Michael Ezra:
Small Circuits Imply Efficient Arthur-Merlin Protocols. Electron. Colloquium Comput. Complex. TR21 (2021) - [i44]Inbar Kaslasi, Ron D. Rothblum, Prashant Nalini Vasudevan:
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers. IACR Cryptol. ePrint Arch. 2021: 233 (2021) - [i43]Justin Holmgren, Alex Lombardi, Ron D. Rothblum:
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge). IACR Cryptol. ePrint Arch. 2021: 286 (2021) - [i42]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Time- and Space-Efficient Arguments from Groups of Unknown Order. IACR Cryptol. ePrint Arch. 2021: 358 (2021) - [i41]Liron Bronfman, Ron D. Rothblum:
PCPs and Instance Compression from a Cryptographic Lens. IACR Cryptol. ePrint Arch. 2021: 842 (2021) - [i40]Noga Ron-Zewi, Ron D. Rothblum:
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. IACR Cryptol. ePrint Arch. 2021: 1673 (2021) - 2020
- [j4]Tom Gur, Govind Ramnarayan, Ron Rothblum:
Relaxed Locally Correctable Codes. Theory Comput. 16: 1-68 (2020) - [c37]Lijie Chen, Ron D. Rothblum, Roei Tell, Eylon Yogev:
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds: Extended Abstract. FOCS 2020: 13-23 - [c36]Noga Ron-Zewi, Ron D. Rothblum:
Local Proofs Approaching the Witness Length [Extended Abstract]. FOCS 2020: 846-857 - [c35]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum:
Hard Properties with (Very) Short PCPPs and Their Applications. ITCS 2020: 9:1-9:27 - [c34]Guy N. Rothblum, Ron D. Rothblum:
Batch Verification and Proofs of Proximity with Polylog Overhead. TCC (2) 2020: 108-138 - [c33]Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan:
Batch Verification for Statistical Zero Knowledge Proofs. TCC (2) 2020: 139-167 - [c32]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. TCC (2) 2020: 168-197 - [i39]Inbar Kaslasi, Prashant Nalini Vasudevan, Guy N. Rothblum, Ron Rothblum, Adam Sealfon:
Batch Verification for Statistical Zero Knowledge Proofs. Electron. Colloquium Comput. Complex. TR20 (2020) - [i38]Guy N. Rothblum, Ron Rothblum:
Batch Verification and Proofs of Proximity with Polylog Overhead. Electron. Colloquium Comput. Complex. TR20 (2020) - [i37]Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan:
Batch Verification for Statistical Zero Knowledge Proofs. IACR Cryptol. ePrint Arch. 2020: 1167 (2020) - [i36]Alexander R. Block, Justin Holmgren, Alon Rosen, Ron D. Rothblum, Pratik Soni:
Public-Coin Zero-Knowledge Arguments with (almost) Minimal Time and Space Overheads. IACR Cryptol. ePrint Arch. 2020: 1425 (2020)
2010 – 2019
- 2019
- [c31]Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu:
New Constructions of Reusable Designated-Verifier NIZKs. CRYPTO (3) 2019: 670-700 - [c30]Willy Quach, Ron D. Rothblum, Daniel Wichs:
Reusable Designated-Verifier NIZKs for all NP from CDH. EUROCRYPT (2) 2019: 593-621 - [c29]Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki:
Towards Non-Interactive Zero-Knowledge for NP from LWE. Public Key Cryptography (2) 2019: 472-503 - [c28]Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs:
Fiat-Shamir: from practice to theory. STOC 2019: 1082-1090 - [c27]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. TCC (2) 2019: 311-332 - [c26]James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron D. Rothblum:
On the (In)security of Kilian-Based SNARGs. TCC (2) 2019: 522-551 - [i35]Omri Ben-Eliezer, Eldar Fischer, Amit Levi, Ron D. Rothblum:
Hard properties with (very) short PCPPs and their applications. CoRR abs/1909.03255 (2019) - [i34]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. Electron. Colloquium Comput. Complex. TR19 (2019) - [i33]Lijie Chen, Ron Rothblum, Roei Tell, Eylon Yogev:
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. Electron. Colloquium Comput. Complex. TR19 (2019) - [i32]Noga Ron-Zewi, Ron Rothblum:
Local Proofs Approaching the Witness Length. Electron. Colloquium Comput. Complex. TR19 (2019) - [i31]Willy Quach, Ron D. Rothblum, Daniel Wichs:
Reusable Designated-Verifier NIZKs for all NP from CDH. IACR Cryptol. ePrint Arch. 2019: 235 (2019) - [i30]Alex Lombardi, Willy Quach, Ron D. Rothblum, Daniel Wichs, David J. Wu:
New Constructions of Reusable Designated-Verifier NIZKs. IACR Cryptol. ePrint Arch. 2019: 242 (2019) - [i29]James Bartusek, Liron Bronfman, Justin Holmgren, Fermi Ma, Ron Rothblum:
On the (In)security of Kilian-Based SNARGs. IACR Cryptol. ePrint Arch. 2019: 997 (2019) - [i28]Noga Ron-Zewi, Ron D. Rothblum:
Local Proofs Approaching the Witness Length. IACR Cryptol. ePrint Arch. 2019: 1062 (2019) - 2018
- [j3]Tom Gur, Ron D. Rothblum:
Non-interactive proofs of proximity. Comput. Complex. 27(1): 99-207 (2018) - [j2]Oded Goldreich, Tom Gur, Ron D. Rothblum:
Proofs of proximity for context-free languages and read-once branching programs. Inf. Comput. 261: 175-201 (2018) - [c25]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Efficient Batch Verification for UP. CCC 2018: 22:1-22:23 - [c24]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography - Extended Abstract. CRYPTO (3) 2018: 674-697 - [c23]Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum:
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. EUROCRYPT (1) 2018: 91-122 - [c22]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi-Collision Resistant Hash Functions and Their Applications. EUROCRYPT (2) 2018: 133-161 - [c21]Justin Holmgren, Ron Rothblum:
Delegating Computations with (Almost) Minimal Time and Space Overhead. FOCS 2018: 124-135 - [c20]Tom Gur, Yang P. Liu, Ron D. Rothblum:
An Exponential Separation Between MA and AM Proofs of Proximity. ICALP 2018: 73:1-73:15 - [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 - [i27]Tom Gur, Yang P. Liu, Ron D. Rothblum:
An Exponential Separation Between MA and AM Proofs of Proximity. Electron. Colloquium Comput. Complex. TR18 (2018) - [i26]Justin Holmgren, Ron Rothblum:
Delegating Computations with (almost) Minimal Time and Space Overhead. Electron. Colloquium Comput. Complex. TR18 (2018) - [i25]Omer Reingold, Guy N. Rothblum, Ron Rothblum:
Efficient Batch Verification for UP. Electron. Colloquium Comput. Complex. TR18 (2018) - [i24]Ran Canetti, Yilei Chen, Leonid Reyzin, Ron D. Rothblum:
Fiat-Shamir and Correlation Intractability from Strong KDM-Secure Encryption. IACR Cryptol. ePrint Arch. 2018: 131 (2018) - [i23]Ron D. Rothblum, Adam Sealfon, Katerina Sotiraki:
Towards Non-Interactive Zero-Knowledge for NP from LWE. IACR Cryptol. ePrint Arch. 2018: 240 (2018) - [i22]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography. IACR Cryptol. ePrint Arch. 2018: 548 (2018) - [i21]Justin Holmgren, Ron D. Rothblum:
Delegating Computations with (almost) Minimal Time and Space Overhead. IACR Cryptol. ePrint Arch. 2018: 861 (2018) - [i20]Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum:
Fiat-Shamir From Simpler Assumptions. IACR Cryptol. ePrint Arch. 2018: 1004 (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]Tom Gur, Ron D. Rothblum:
A Hierarchy Theorem for Interactive Proofs of Proximity. ITCS 2017: 39:1-39:43 - [i19]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - [i18]Itay Berman, Akshay Degwekar, Ron Rothblum, Prashant Nalini Vasudevan:
From Laconic Zero-Knowledge to Public-Key Cryptography. Electron. Colloquium Comput. Complex. TR17 (2017) - [i17]Tom Gur, Govind Ramnarayan, Ron Rothblum:
Relaxed Locally Correctable Codes. Electron. Colloquium Comput. Complex. TR17 (2017) - [i16]Itay Berman, Ron D. Rothblum, Vinod Vaikuntanathan:
Zero-Knowledge Proofs of Proximity. IACR Cryptol. ePrint Arch. 2017: 114 (2017) - [i15]Abhishek Jain, Yael Tauman Kalai, Dakshita Khurana, Ron Rothblum:
Distinguisher-Dependent Simulation in Two Rounds and its Applications. IACR Cryptol. ePrint Arch. 2017: 330 (2017) - [i14]Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Multi Collision Resistant Hash Functions and their Applications. IACR Cryptol. ePrint Arch. 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. Electron. Colloquium Comput. Complex. TR16 (2016) - [i12]Yevgeniy Dodis, Shai Halevi, Ron D. Rothblum, Daniel Wichs:
Spooky Encryption and its Applications. IACR Cryptol. ePrint Arch. 2016: 272 (2016) - [i11]Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum:
From Obfuscation to the Security of Fiat-Shamir for Proofs. IACR Cryptol. ePrint Arch. 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]Tom Gur, Ron D. Rothblum:
Non-Interactive Proofs of Proximity. ITCS 2015: 133-142 - [i10]Oded Goldreich, Tom Gur, Ron Rothblum:
Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs. Electron. Colloquium Comput. Complex. TR15 (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. Cryptol. 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]Yael Tauman Kalai, Ran Raz, Ron D. Rothblum:
Delegation for bounded space. STOC 2013: 565-574 - [c4]Ron Rothblum:
On the Circular Security of Bit-Encryption. TCC 2013: 579-598 - [i9]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. Electron. Colloquium Comput. Complex. TR13 (2013) - [i8]Tom Gur, Ron Rothblum:
Non-Interactive Proofs of Proximity. Electron. Colloquium Comput. Complex. TR13 (2013) - [i7]Yael Tauman Kalai, Ran Raz, Ron Rothblum:
How to Delegate Computations: The Power of No-Signaling Proofs. Electron. Colloquium Comput. Complex. TR13 (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 Cryptol. ePrint Arch. 2013: 480 (2013) - [i5]Yael Tauman Kalai, Ran Raz, Ron Rothblum:
How to Delegate Computations: The Power of No-Signaling Proofs. IACR Cryptol. ePrint Arch. 2013: 862 (2013) - 2012
- [i4]Ron Rothblum:
On the Circular Security of Bit-Encryption. IACR Cryptol. ePrint Arch. 2012: 102 (2012) - 2011
- [c3]Ron Rothblum:
Homomorphic Encryption: From Private-Key to Public-Key. TCC 2011: 219-234 - [i3]Oded Goldreich, Ron Rothblum:
Enhancements of Trapdoor Permutations. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i2]Ron Rothblum:
A Taxonomy of Enhanced Trapdoor Permutations. Electron. Colloquium Comput. Complex. TR10 (2010) - [i1]Ron Rothblum:
Homomorphic Encryption: from Private-Key to Public-Key. Electron. Colloquium Comput. Complex. TR10 (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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-08 21:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
