default search action
Guy N. 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
- [c73]Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum:
On Computationally Efficient Multi-Class Calibration. COLT 2024: 1983-2026 - [c72]Noga Amit
, Guy N. Rothblum
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. CRYPTO (10) 2024: 3-37 - [c71]Guy N. Rothblum, Eran Omri, Junye Chen, Kunal Talwar:
PINE: Efficient Verification of a Euclidean Norm Bound of a Secret-Shared Vector. USENIX Security Symposium 2024 - [e5]Guy N. Rothblum
5th Symposium on Foundations of Responsible Computing, FORC 2024, June 12-14, 2024, Harvard University, Cambridge, MA, USA. LIPIcs 295, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-319-5 [contents] - [i68]Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum:
On Computationally Efficient Multi-Class Calibration. CoRR abs/2402.07821 (2024) - [i67]Noga Amit, Shafi Goldwasser, Orr Paradise, Guy N. Rothblum:
Models That Prove Their Own Correctness. CoRR abs/2405.15722 (2024) - [i66]Hilal Asi, Fabian Boemer, Nicholas Genise, Muhammad Haris Mughees, Tabitha Ogilvie, Rehan Rishi, Guy N. Rothblum, Kunal Talwar, Karl Tarbe, Ruiyu Zhu, Marco Zuliani:
Scalable Private Search with Wally. CoRR abs/2406.06761 (2024) - [i65]Tal Herman, Guy N. Rothblum:
How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions. CoRR abs/2409.06594 (2024) - [i64]Noga Amir, Oded Goldreich, Guy N. Rothblum:
Doubly Sub-linear Interactive Proofs of Proximity. Electron. Colloquium Comput. Complex. TR24 (2024) - [i63]Noga Amit, Orr Paradise, Guy N. Rothblum, Shafi Goldwasser:
Models That Prove Their Own Correctness. Electron. Colloquium Comput. Complex. TR24 (2024) - [i62]Noga Amit, Guy N. Rothblum:
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. Electron. Colloquium Comput. Complex. TR24 (2024) - [i61]Tal Herman, Guy N. Rothblum:
Interactive Proofs for General Distribution Properties. Electron. Colloquium Comput. Complex. TR24 (2024) - [i60]Noga Amit, Guy N. Rothblum:
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. IACR Cryptol. ePrint Arch. 2024: 850 (2024) - 2023
- [c70]Guy N. Rothblum
Indistinguishable Predictions and Multi-group Fair Learning. EUROCRYPT (1) 2023: 3-21 - [c69]Tal Herman, Guy N. Rothblum:
Doubley-Efficient Interactive Proofs for Distribution Properties. FOCS 2023: 743-751 - [c68]Cynthia Dwork, Omer Reingold, Guy N. Rothblum:
From the Real Towards the Ideal: Risk Prediction in a Better World. FORC 2023: 1:1-1:17 - [c67]Oded Goldreich, Guy N. Rothblum, Tal Skverer:
On Interactive Proofs of Proximity with Proof-Oblivious Queries. ITCS 2023: 59:1-59:16 - [c66]Guy N. Rothblum, Gal Yona:
Decision-Making Under Miscalibration. ITCS 2023: 92:1-92:20 - [c65]Noga Amit, Guy N. Rothblum:
Constant-Round Arguments from One-Way Functions. STOC 2023: 1537-1544 - [e4]Guy N. Rothblum
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part I. Lecture Notes in Computer Science 14369, Springer 2023, ISBN 978-3-031-48614-2 [contents] - [e3]Guy N. Rothblum
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part II. Lecture Notes in Computer Science 14370, Springer 2023, ISBN 978-3-031-48617-3 [contents] - [e2]Guy N. Rothblum
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part III. Lecture Notes in Computer Science 14371, Springer 2023, ISBN 978-3-031-48620-3 [contents] - [e1]Guy N. Rothblum
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part IV. Lecture Notes in Computer Science 14372, Springer 2023, ISBN 978-3-031-48623-4 [contents] - [i59]Kunal Talwar, Shan Wang, Audra McMillan, Vojta Jina, Vitaly Feldman, Bailey Basile, Áine Cahill, Yi Sheng Chan, Mike Chatzidakis, Junye Chen, Oliver Chick, Mona Chitnis, Suman Ganta, Yusuf Goren, Filip Granqvist, Kristine Guo, Frederic Jacobs, Omid Javidbakht, Albert Liu, Richard Low, Dan Mascenik, Steve Myers, David Park, Wonhee Park, Gianni Parsa, Tommy Pauly, Christian Priebe, Rehan Rishi, Guy N. Rothblum, Michael Scaria, Linmao Song, Congzheng Song, Karl Tarbe, Sebastian Vogt, Luke Winstrom, Shundong Zhou:
Samplable Anonymous Aggregation for Private Federated Data Analysis. CoRR abs/2307.15017 (2023) - [i58]Guy N. Rothblum, Eran Omri, Junye Chen, Kunal Talwar:
PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors. CoRR abs/2311.10237 (2023) - [i57]Noga Amit, Guy N. Rothblum:
Constant-Round Arguments from One-Way Functions. Electron. Colloquium Comput. Complex. TR23 (2023) - [i56]Tal Herman, Guy N. Rothblum:
Doubly-Efficient Interactive Proofs for Distribution Properties. Electron. Colloquium Comput. Complex. TR23 (2023) - [i55]Noga Amit, Guy N. Rothblum:
Constant-Round Arguments from One-Way Functions. IACR Cryptol. ePrint Arch. 2023: 802 (2023) - 2022
- [c64]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature. ALT 2022: 342-380 - [c63]Guy Goldberg, Guy N. Rothblum:
Sample-Based Proofs of Proximity. ITCS 2022: 77:1-77:19 - [c62]Gili Karni, Guy N. Rothblum, Gal Yona:
On Fairness and Stability in Two-Sided Matchings. ITCS 2022: 92:1-92:17 - [c61]Tal Herman, Guy N. Rothblum:
Verifying the unseen: interactive proofs for label-invariant distribution properties. STOC 2022: 1208-1219 - [i54]Guy N. Rothblum, Gal Yona:
Decision-Making under Miscalibration. CoRR abs/2203.09852 (2022) - [i53]Oded Goldreich, Guy N. Rothblum, Tal Skverer:
On Interactive Proofs of Proximity with Proof-Oblivious Queries. Electron. Colloquium Comput. Complex. TR22 (2022) - [i52]Tal Herman, Guy N. Rothblum:
Verifying The Unseen: Interactive Proofs for Label-Invariant Distribution Properties. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j11]Noam Barda
Addressing bias in prediction models by improving subpopulation calibration. J. Am. Medical Informatics Assoc. 28(3): 549-558 (2021) - [j10]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Constant-Round Interactive Proofs for Delegating Computation. SIAM J. Comput. 50(3) (2021) - [c60]Gal Arnon
On Prover-Efficient Public-Coin Emulation of Interactive Proofs. ITC 2021: 3:1-3:15 - [c59]Guy N. Rothblum, Gal Yona:
Multi-group Agnostic PAC Learnability. ICML 2021: 9107-9115 - [c58]Shafi Goldwasser
Interactive Proofs for Verifying Machine Learning. ITCS 2021: 41:1-41:19 - [c57]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Outcome indistinguishability. STOC 2021: 1095-1108 - [i51]Guy N. Rothblum, Gal Yona:
Multi-group Agnostic PAC Learnability. CoRR abs/2105.09989 (2021) - [i50]Guy N. Rothblum, Gal Yona:
Consider the Alternatives: Navigating Fairness-Accuracy Tradeoffs via Disqualification. CoRR abs/2110.00813 (2021) - [i49]Gili Karni, Guy N. Rothblum, Gal Yona:
On Fairness and Stability in Two-Sided Matchings. CoRR abs/2111.10885 (2021) - [i48]Guy Goldberg, Guy N. Rothblum:
Sample-Based Proofs of Proximity. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c56]Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona:
Preference-informed fairness. FAT* 2020: 546 - [c55]Cynthia Dwork, Christina Ilvento, Guy N. Rothblum, Pragya Sur:
Abstracting Fairness: Oracles, Metrics, and Interpretability. FORC 2020: 8:1-8:16 - [c54]Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona:
Preference-Informed Fairness. ITCS 2020: 16:1-16:23 - [c53]Guy N. Rothblum, Ron D. Rothblum:
Batch Verification and Proofs of Proximity with Polylog Overhead. TCC (2) 2020: 108-138 - [c52]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 - [p3]Oded Goldreich, Guy N. Rothblum:
Worst-Case to Average-Case Reductions for Subclasses of P. Computational Complexity and Property Testing 2020: 249-295 - [p2]Oded Goldreich, Guy N. Rothblum:
Constant-Round Interactive Proof Systems for AC0[2] and NC1. Computational Complexity and Property Testing 2020: 326-351 - [i47]Cynthia Dwork, Christina Ilvento, Guy N. Rothblum, Pragya Sur:
Abstracting Fairness: Oracles, Metrics, and Interpretability. CoRR abs/2004.01840 (2020) - [i46]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Outcome Indistinguishability. CoRR abs/2011.13426 (2020) - [i45]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Outcome Indistinguishability. Electron. Colloquium Comput. Complex. TR20 (2020) - [i44]Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff:
Interactive Proofs for Verifying Machine Learning. Electron. Colloquium Comput. Complex. TR20 (2020) - [i43]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) - [i42]Guy N. Rothblum, Ron Rothblum:
Batch Verification and Proofs of Proximity with Polylog Overhead. Electron. Colloquium Comput. Complex. TR20 (2020) - [i41]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)
2010 – 2019
- 2019
- [c51]Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona:
Learning from Outcomes: Evidence-Based Rankings. FOCS 2019: 106-125 - [c50]Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein:
Fine-grained Complexity Meets IP = PSPACE. SODA 2019: 1-20 - [c49]Scott Aaronson, Guy N. Rothblum:
Gentle measurement of quantum states and differential privacy. STOC 2019: 322-333 - [c48]Ran Canetti, Yilei Chen, Justin Holmgren
Fiat-Shamir: from practice to theory. STOC 2019: 1082-1090 - [c47]Arka Rai Choudhuri
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir. STOC 2019: 1103-1114 - [c46]Moni Naor, Omer Paneth, Guy N. Rothblum:
Incrementally Verifiable Computation via Incremental PCPs. TCC (2) 2019: 552-576 - [p1]Guy N. Rothblum:
Doubly efficient interactive proofs. Providing Sound Foundations for Cryptography 2019: 649-691 - [i40]Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona:
Preference-Informed Fairness. CoRR abs/1904.01793 (2019) - [i39]Scott Aaronson, Guy N. Rothblum:
Gentle Measurement of Quantum States and Differential Privacy. Electron. Colloquium Comput. Complex. TR19 (2019) - [i38]Gal Arnon
On Prover-Efficient Public-Coin Emulation of Interactive Proofs. Electron. Colloquium Comput. Complex. TR19 (2019) - [i37]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. Electron. Colloquium Comput. Complex. TR19 (2019) - [i36]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. IACR Cryptol. ePrint Arch. 2019: 549 (2019) - [i35]Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
PPAD-Hardness via Iterated Squaring Modulo a Composite. IACR Cryptol. ePrint Arch. 2019: 667 (2019) - [i34]Moni Naor, Omer Paneth, Guy N. Rothblum:
Incrementally Verifiable Computation via Incremental PCPs. IACR Cryptol. ePrint Arch. 2019: 1407 (2019) - 2018
- [c45]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Efficient Batch Verification for UP. CCC 2018: 22:1-22:23 - [c44]Oded Goldreich, Guy N. Rothblum:
Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems. FOCS 2018: 77-88 - [c43]Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Multicalibration: Calibration for the (Computationally-Identifiable) Masses. ICML 2018: 1944-1953 - [c42]Gal Yona, Guy N. Rothblum:
Probably Approximately Metric-Fair Learning. ICML 2018: 5666-5674 - [c41]Oded Goldreich, Guy N. Rothblum:
Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets. ITCS 2018: 18:1-18:19 - [c40]Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Fairness Through Computationally-Bounded Awareness. NeurIPS 2018: 4847-4857 - [c39]Mark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke:
Composable and versatile privacy via truncated CDP. STOC 2018: 74-86 - [i33]Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Fairness Through Computationally-Bounded Awareness. CoRR abs/1803.03239 (2018) - [i32]Guy N. Rothblum, Gal Yona:
Probably Approximately Metric-Fair Learning. CoRR abs/1803.03242 (2018) - [i31]Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein:
Fine-grained Complexity Meets IP = PSPACE. CoRR abs/1805.02351 (2018) - [i30]Oded Goldreich, Guy N. Rothblum:
Counting t-cliques: Worst-case to average-case reductions and Direct interactive proof systems. Electron. Colloquium Comput. Complex. TR18 (2018) - [i29]Oded Goldreich, Guy N. Rothblum:
Constant-round interactive proof systems for AC0[2] and NC1. Electron. Colloquium Comput. Complex. TR18 (2018) - [i28]Omer Reingold, Guy N. Rothblum, Ron Rothblum:
Efficient Batch Verification for UP. Electron. Colloquium Comput. Complex. TR18 (2018) - [i27]Ran Canetti, Yilei Chen, Justin Holmgren
Fiat-Shamir From Simpler Assumptions. IACR Cryptol. ePrint Arch. 2018: 1004 (2018) - 2017
- [j9]Zvika Brakerski, Guy N. Rothblum:
Obfuscating Conjunctions. J. Cryptol. 30(1): 289-320 (2017) - [c38]Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum:
From Obfuscation to the Security of Fiat-Shamir for Proofs. CRYPTO (2) 2017: 224-251 - [c37]Omer Paneth, Guy N. Rothblum:
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments. TCC (2) 2017: 283-315 - [i26]Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum:
Calibration for the (Computationally-Identifiable) Masses. CoRR abs/1711.08513 (2017) - [i25]Oded Goldreich, Guy N. Rothblum:
Simple doubly-efficient interactive proof systems for locally-characterizable sets. Electron. Colloquium Comput. Complex. TR17 (2017) - [i24]Oded Goldreich, Guy N. Rothblum:
Worst-case to Average-case reductions for subclasses of P. Electron. Colloquium Comput. Complex. TR17 (2017) - [i23]Shafi Goldwasser, Guy N. Rothblum, Yael Tauman Kalai:
Delegating Computation: Interactive Proofs for Muggles. Electron. Colloquium Comput. Complex. TR17 (2017) - [i22]Omer Paneth, Guy N. Rothblum:
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments. IACR Cryptol. ePrint Arch. 2017: 903 (2017) - 2016
- [c36]Cynthia Dwork, Moni Naor, Guy N. Rothblum:
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems. CRYPTO (3) 2016: 123-145 - [c35]Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Constant-round interactive proofs for delegating computation. STOC 2016: 49-62 - [i21]Cynthia Dwork, Guy N. Rothblum:
Concentrated Differential Privacy. CoRR abs/1603.01887 (2016) - [i20]Cynthia Dwork, Moni Naor, Guy N. Rothblum:
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. Electron. Colloquium Comput. Complex. TR16 (2016) - [i19]Omer Reingold, Ron Rothblum, Guy N. Rothblum:
Constant-Round Interactive Proofs for Delegating Computation. Electron. Colloquium Comput. Complex. TR16 (2016) - [i18]Cynthia Dwork, Moni Naor, Guy N. Rothblum:
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. IACR Cryptol. ePrint Arch. 2016: 291 (2016) - [i17]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
- [j8]Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
Delegating Computation: Interactive Proofs for Muggles. J. ACM 62(4): 27:1-27:64 (2015) - [j7]Shafi Goldwasser, Guy N. Rothblum:
How to Compute in the Presence of Leakage. SIAM J. Comput. 44(5): 1480-1549 (2015) - [c34]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum:
Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) 2015: 735-751 - 2014
- [j6]Shafi Goldwasser, Guy N. Rothblum:
On Best-Possible Obfuscation. J. Cryptol. 27(3): 480-505 (2014) - [c33]Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum:
Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). ICALP (1) 2014: 859-870 - [c32]Zvika Brakerski, Guy N. Rothblum:
Black-box obfuscation for d-CNFs. ITCS 2014: 235-250 - [c31]Zvika Brakerski, Guy N. Rothblum:
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding. TCC 2014: 1-25 - [i16]Omer Paneth, Guy N. Rothblum:
Publicly Verifiable Non-Interactive Arguments for Delegating Computation. IACR Cryptol. ePrint Arch. 2014: 981 (2014) - 2013
- [j5]Ran Canetti, Ben Riva, Guy N. Rothblum:
Refereed delegation of computation. Inf. Comput. 226: 16-36 (2013) - [c30]Zvika Brakerski, Guy N. Rothblum:
Obfuscating Conjunctions. CRYPTO (2) 2013: 416-434 - [c29]Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson:
Interactive proofs of proximity: delegating computation in sublinear time. STOC 2013: 793-802 - [i15]Zvika Brakerski, Guy N. Rothblum:
Obfuscating Conjunctions. IACR Cryptol. ePrint Arch. 2013: 471 (2013) - [i14]Zvika Brakerski, Guy N. Rothblum:
Black-Box Obfuscation for d-CNFs. IACR Cryptol. ePrint Arch. 2013: 557 (2013) - [i13]Zvika Brakerski, Guy N. Rothblum:
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding. IACR Cryptol. ePrint Arch. 2013: 563 (2013) - 2012
- [c28]Guy N. Rothblum:
How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware. CRYPTO 2012: 552-569 - [c27]Shafi Goldwasser, Guy N. Rothblum:
How to Compute in the Presence of Leakage. FOCS 2012: 31-40 - [c26]Ran Canetti, Ben Riva, Guy N. Rothblum:
Two Protocols for Delegation of Computation. ICITS 2012: 37-61 - [c25]Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio
Private data release via learning thresholds. SODA 2012: 168-187 - [i12]Shafi Goldwasser, Guy N. Rothblum:
How to Compute in the Presence of Leakage. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j4]Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan:
Securely Obfuscating Re-Encryption. J. Cryptol. 24(4): 694-719 (2011) - [c24]Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum:
Program Obfuscation with Leaky Hardware. ASIACRYPT 2011: 722-739 - [c23]Ran Canetti, Ben Riva, Guy N. Rothblum:
Practical delegation of computation using multiple servers. CCS 2011: 445-454 - [c22]Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings. ICS 2011: 460-475 - [i11]Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio:
Private Data Release via Learning Thresholds. CoRR abs/1107.2444 (2011) - [i10]Ran Canetti, Ben Riva, Guy N. Rothblum:
Two 1-Round Protocols for Delegation of Computation. IACR Cryptol. ePrint Arch. 2011: 518 (2011) - [i9]Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum:
Program Obfuscation with Leaky Hardware. IACR Cryptol. ePrint Arch. 2011: 660 (2011) - 2010
- [j3]Guy N. Rothblum, Salil P. Vadhan:
Are PCPs Inherent in Efficient Arguments? Comput. Complex. 19(2): 265-304 (2010) - [c21]Shafi Goldwasser, Guy N. Rothblum:
Securing Computation against Continuous Leakage. CRYPTO 2010: 59-79 - [c20]Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan:
Boosting and Differential Privacy. FOCS 2010: 51-60 - [c19]Moritz Hardt, Guy N. Rothblum:
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis. FOCS 2010: 61-70 - [c18]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin:
Pan-Private Streaming Algorithms. ICS 2010: 66-80 - [c17]Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum:
Differential privacy under continual observation. STOC 2010: 715-724 - [c16]Ran Canetti, Guy N. Rothblum, Mayank Varia:
Obfuscation of Hyperplane Membership. TCC 2010: 72-89 - [c15]Sebastian Faust, Eike Kiltz
Leakage-Resilient Signatures. TCC 2010: 343-360 - [i8]Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan:
On Approximating the Entropy of Polynomial Mappings. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [b1]Guy N. Rothblum:
Delegating computation reliably: paradigms and constructions. Massachusetts Institute of Technology, Cambridge, MA, USA, 2009 - [j2]Moni Naor, Guy N. Rothblum:
The complexity of online memory checking. J. ACM 56(1): 2:1-2:46 (2009) - [j1]Ronen Gradwohl
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. Theory Comput. Syst. 44(2): 245-268 (2009) - [c14]Guy N. Rothblum, Salil P. Vadhan:
Are PCPs Inherent in Efficient Arguments? CCC 2009: 81-92 - [c13]Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan:
On the complexity of differentially private data release: efficient algorithms and hardness results. STOC 2009: 381-390 - [c12]Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan:
How Efficient Can Memory Checking Be?. TCC 2009: 503-520 - [c11]Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan:
Weak Verifiable Random Functions. TCC 2009: 558-576 - [i7]Guy N. Rothblum, Salil P. Vadhan:
Are PCPs Inherent in Efficient Arguments? Electron. Colloquium Comput. Complex. TR09 (2009) - [i6]Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy N. Rothblum:
Leakage-Resilient Signatures. IACR Cryptol. ePrint Arch. 2009: 282 (2009) - 2008
- [c10]Dan Gutfreund, Guy N. Rothblum:
The Complexity of Local List Decoding. APPROX-RANDOM 2008: 455-468 - [c9]Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
One-Time Programs. CRYPTO 2008: 39-56 - [c8]Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum:
Delegating computation: interactive proofs for muggles. STOC 2008: 113-122 - [c7]Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum:
A (de)constructive approach to program checking. STOC 2008: 143-152 - [i5]Dan Gutfreund, Guy N. Rothblum:
The Complexity of Local List Decoding. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c6]Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum:
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. FUN 2007: 166-182 - [c5]Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum:
Verifying and decoding in constant depth. STOC 2007: 440-449 - [c4]Shafi Goldwasser, Guy N. Rothblum:
On Best-Possible Obfuscation. TCC 2007: 194-213 - [c3]Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan:
Securely Obfuscating Re-encryption. TCC 2007: 233-252 - [i4]Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum:
A (De)constructive Approach to Program Checking. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [c2]Moni Naor, Guy N. Rothblum:
Learning to impersonate. ICML 2006: 649-656 - [i3]Moni Naor, Guy N. Rothblum:
The Complexity of Online Memory Checking. Electron. Colloquium Comput. Complex. TR06 (2006) - [i2]Moni Naor, Guy N. Rothblum:
The Complexity of Online Memory Checking. IACR Cryptol. ePrint Arch. 2006: 91 (2006) - 2005
- [c1]Moni Naor, Guy N. Rothblum:
The Complexity of Online Memory Checking. FOCS 2005: 573-584 - 2004
- [i1]Erez Petrank, Guy N. Rothblum:
Selection from Structured Data Sets. Electron. Colloquium Comput. Complex. TR04 (2004)
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-10-14 23:27 CEST 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: