Guy N. Rothblum

176 papers A* 39A 15B 8Misc 1Journal 88Unranked 16
YearRankTypeTitle / Venue / Authors
2025 J jnl
Accuracy vs. Accuracy: Computational Tradeoffs Between Classification Rates and Utility.
CoRR
Noga Amit, Omer Reingold, Guy N. Rothblum
2025 A conf
Doubly Sub-Linear Interactive Proofs of Proximity.
ITCS
Noga Amir, Oded Goldreich, Guy N. Rothblum
2025 A* conf
How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions.
ICLR
Tal Herman, Guy N. Rothblum
2025 J jnl
Interactive proof systems for FARNESS.
Electron. Colloquium Comput. Complex.
Oded Goldreich, Tal Herman, Guy N. Rothblum
2025 J jnl
Local Pan-Privacy for Federated Analytics.
CoRR
Vitaly Feldman, Audra McMillan, Guy N. Rothblum, Kunal Talwar
2025 A* conf
Local Pan-privacy for Federated Analytics.
ICML
Vitaly Feldman, Audra McMillan, Guy N. Rothblum, Kunal Talwar
2025 J jnl
Location-Invariant Properties of Functions versus Properties of Distributions: United in Testing but Separated in Verification.
Electron. Colloquium Comput. Complex.
Oded Goldreich, Guy N. Rothblum
2025 J jnl
On doubly-sublinear interactive proofs for distributions.
Electron. Colloquium Comput. Complex.
Oded Goldreich, Guy N. Rothblum
2025 J jnl
On the Impossibility of Separating Intelligence from Judgment: The Computational Intractability of Filtering for AI Alignment.
CoRR
Sarah Ball, Greg Gluch, Shafi Goldwasser, Frauke Kreuter, Omer Reingold, Guy N. Rothblum
2025 J jnl
PREAMBLE: Private and Efficient Aggregation of Block Sparse Vectors and Applications.
CoRR
Hilal Asi, Vitaly Feldman, Hannah Keller, Guy N. Rothblum, Kunal Talwar
2025 J jnl
PREAMBLE: Private and Efficient Aggregation of Block Sparse Vectors and Applications.
IACR Cryptol. ePrint Arch.
Hilal Asi, Vitaly Feldman, Hannah Keller, Guy N. Rothblum, Kunal Talwar
2025 A* conf
Proving Natural Distribution Properties is Harder than Testing Them.
FOCS
Tal Herman, Guy N. Rothblum
2025 J jnl
Proving Natural Distribution Properties is Harder than Testing Them.
Electron. Colloquium Comput. Complex.
Tal Herman, Guy N. Rothblum
2024 — ed.
5th Symposium on Foundations of Responsible Computing, FORC 2024, Harvard University, Cambridge, MA, USA, June 12-14, 2024
FORC
Guy N. Rothblum
2024 — conf
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions.
CRYPTO (10)
Noga Amit, Guy N. Rothblum
2024 J jnl
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions.
Electron. Colloquium Comput. Complex.
Noga Amit, Guy N. Rothblum
2024 J jnl
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions.
IACR Cryptol. ePrint Arch.
Noga Amit, Guy N. Rothblum
2024 J jnl
Doubly Sub-linear Interactive Proofs of Proximity.
Electron. Colloquium Comput. Complex.
Noga Amir, Oded Goldreich, Guy N. Rothblum
2024 J jnl
How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions.
CoRR
Tal Herman, Guy N. Rothblum
2024 A* conf
Interactive Proofs for General Distribution Properties.
FOCS
Tal Herman, Guy N. Rothblum
2024 J jnl
Interactive Proofs for General Distribution Properties.
Electron. Colloquium Comput. Complex.
Tal Herman, Guy N. Rothblum
2024 J jnl
Models That Prove Their Own Correctness.
CoRR
Noga Amit, Shafi Goldwasser, Orr Paradise, Guy N. Rothblum
2024 J jnl
Models That Prove Their Own Correctness.
Electron. Colloquium Comput. Complex.
Noga Amit, Orr Paradise, Guy N. Rothblum, Shafi Goldwasser
2024 A* conf
On Computationally Efficient Multi-Class Calibration.
COLT
Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum
2024 J jnl
On Computationally Efficient Multi-Class Calibration.
CoRR
Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum
2024 A* conf
PINE: Efficient Verification of a Euclidean Norm Bound of a Secret-Shared Vector.
USENIX Security Symposium
Guy N. Rothblum, Eran Omri, Junye Chen, Kunal Talwar
2024 A* conf
Samplable Anonymous Aggregation for Private Federated Data Analysis.
CCS
Kunal Talwar, Shan Wang, Audra McMillan, Vitaly Feldman, Pansy Bansal, Bailey Basile, Áine Cahill, Yi Sheng Chan, Mike Chatzidakis, Junye Chen, Oliver R. A. 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, Congzheng Song, Linmao Song, Karl Tarbe, Sebastian Vogt, Shundong Zhou, Vojta Jina, Michael Scaria, Luke Winstrom
2024 J jnl
Scalable Private Search with Wally.
CoRR
Hilal Asi, Fabian Boemer, Nicholas Genise, Muhammad Haris Mughees, Tabitha Ogilvie, Rehan Rishi, Guy N. Rothblum, Kunal Talwar, Karl Tarbe, Ruiyu Zhu, Marco Zuliani
2023 A* conf
Constant-Round Arguments from One-Way Functions.
STOC
Noga Amit, Guy N. Rothblum
2023 J jnl
Constant-Round Arguments from One-Way Functions.
Electron. Colloquium Comput. Complex.
Noga Amit, Guy N. Rothblum
2023 J jnl
Constant-Round Arguments from One-Way Functions.
IACR Cryptol. ePrint Arch.
Noga Amit, Guy N. Rothblum
2023 A conf
Decision-Making Under Miscalibration.
ITCS
Guy N. Rothblum, Gal Yona
2023 A* conf
Doubley-Efficient Interactive Proofs for Distribution Properties.
FOCS
Tal Herman, Guy N. Rothblum
2023 J jnl
Doubly-Efficient Interactive Proofs for Distribution Properties.
Electron. Colloquium Comput. Complex.
Tal Herman, Guy N. Rothblum
2023 — conf
From the Real Towards the Ideal: Risk Prediction in a Better World.
FORC
Cynthia Dwork, Omer Reingold, Guy N. Rothblum
2023 — conf
Indistinguishable Predictions and Multi-group Fair Learning.
EUROCRYPT (1)
Guy N. Rothblum
2023 A conf
On Interactive Proofs of Proximity with Proof-Oblivious Queries.
ITCS
Oded Goldreich, Guy N. Rothblum, Tal Skverer
2023 J jnl
PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors.
CoRR
Guy N. Rothblum, Eran Omri, Junye Chen, Kunal Talwar
2023 J jnl
Samplable Anonymous Aggregation for Private Federated Data Analysis.
CoRR
Kunal Talwar, Shan Wang, Audra McMillan, Vojta Jina, Vitaly Feldman, Bailey Basile, Áine Cahill, Yi Sheng Chan, Mike Chatzidakis, Junye Chen, Oliver R. A. 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
2023 — ed.
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part I
TCC (1)
Guy N. Rothblum, Hoeteck Wee
2023 — ed.
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part II
TCC (2)
Guy N. Rothblum, Hoeteck Wee
2023 — ed.
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part III
TCC (3)
Guy N. Rothblum, Hoeteck Wee
2023 — ed.
Theory of Cryptography - 21st International Conference, TCC 2023, Taipei, Taiwan, November 29 - December 2, 2023, Proceedings, Part IV
TCC (4)
Guy N. Rothblum, Hoeteck Wee
2022 B conf
Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature.
ALT
Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2022 J jnl
Decision-Making under Miscalibration.
CoRR
Guy N. Rothblum, Gal Yona
2022 A conf
On Fairness and Stability in Two-Sided Matchings.
ITCS
Gili Karni, Guy N. Rothblum, Gal Yona
2022 J jnl
On Interactive Proofs of Proximity with Proof-Oblivious Queries.
Electron. Colloquium Comput. Complex.
Oded Goldreich, Guy N. Rothblum, Tal Skverer
2022 A conf
Sample-Based Proofs of Proximity.
ITCS
Guy Goldberg, Guy N. Rothblum
2022 J jnl
Verifying The Unseen: Interactive Proofs for Label-Invariant Distribution Properties.
Electron. Colloquium Comput. Complex.
Tal Herman, Guy N. Rothblum
2022 A* conf
Verifying the unseen: interactive proofs for label-invariant distribution properties.
STOC
Tal Herman, Guy N. Rothblum
2021 J jnl
Addressing bias in prediction models by improving subpopulation calibration.
J. Am. Medical Informatics Assoc.
Noam Barda, Gal Yona, Guy N. Rothblum, Philip Greenland, Morton Leibowitz, Ran D. Balicer, Eitan Bachmat, Noa Dagan
2021 J jnl
Consider the Alternatives: Navigating Fairness-Accuracy Tradeoffs via Disqualification.
CoRR
Guy N. Rothblum, Gal Yona
2021 J jnl
Constant-Round Interactive Proofs for Delegating Computation.
SIAM J. Comput.
Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2021 A conf
Interactive Proofs for Verifying Machine Learning.
ITCS
Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff
2021 A* conf
Multi-group Agnostic PAC Learnability.
ICML
Guy N. Rothblum, Gal Yona
2021 J jnl
Multi-group Agnostic PAC Learnability.
CoRR
Guy N. Rothblum, Gal Yona
2021 J jnl
On Fairness and Stability in Two-Sided Matchings.
CoRR
Gili Karni, Guy N. Rothblum, Gal Yona
2021 A conf
On Prover-Efficient Public-Coin Emulation of Interactive Proofs.
ITC
Gal Arnon, Guy N. Rothblum
2021 A* conf
Outcome indistinguishability.
STOC
Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2021 J jnl
Sample-Based Proofs of Proximity.
Electron. Colloquium Comput. Complex.
Guy Goldberg, Guy N. Rothblum
2020 — conf
Abstracting Fairness: Oracles, Metrics, and Interpretability.
FORC
Cynthia Dwork, Christina Ilvento, Guy N. Rothblum, Pragya Sur
2020 J jnl
Abstracting Fairness: Oracles, Metrics, and Interpretability.
CoRR
Cynthia Dwork, Christina Ilvento, Guy N. Rothblum, Pragya Sur
2020 — conf
Batch Verification and Proofs of Proximity with Polylog Overhead.
TCC (2)
Guy N. Rothblum, Ron D. Rothblum
2020 J jnl
Batch Verification and Proofs of Proximity with Polylog Overhead.
Electron. Colloquium Comput. Complex.
Guy N. Rothblum, Ron Rothblum
2020 — conf
Batch Verification for Statistical Zero Knowledge Proofs.
TCC (2)
Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
2020 J jnl
Batch Verification for Statistical Zero Knowledge Proofs.
Electron. Colloquium Comput. Complex.
Inbar Kaslasi, Prashant Nalini Vasudevan, Guy N. Rothblum, Ron Rothblum, Adam Sealfon
2020 J jnl
Batch Verification for Statistical Zero Knowledge Proofs.
IACR Cryptol. ePrint Arch.
Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
2020 — ch.
Constant-Round Interactive Proof Systems for AC0[2] and NC1.
Computational Complexity and Property Testing
Oded Goldreich, Guy N. Rothblum
2020 J jnl
Interactive Proofs for Verifying Machine Learning.
Electron. Colloquium Comput. Complex.
Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff
2020 J jnl
Outcome Indistinguishability.
CoRR
Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2020 J jnl
Outcome Indistinguishability.
Electron. Colloquium Comput. Complex.
Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2020 A conf
Preference-Informed Fairness.
ITCS
Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona
2020 — conf
Preference-informed fairness.
FAT*
Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona
2020 — ch.
Worst-Case to Average-Case Reductions for Subclasses of P.
Computational Complexity and Property Testing
Oded Goldreich, Guy N. Rothblum
2019 — ch.
Doubly efficient interactive proofs.
Providing Sound Foundations for Cryptography
Guy N. Rothblum
2019 A* conf
Fiat-Shamir: from practice to theory.
STOC
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs
2019 J jnl
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir.
Electron. Colloquium Comput. Complex.
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
2019 J jnl
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir.
IACR Cryptol. ePrint Arch.
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
2019 A* conf
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir.
STOC
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
2019 A* conf
Fine-grained Complexity Meets IP = PSPACE.
SODA
Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein
2019 J jnl
Gentle Measurement of Quantum States and Differential Privacy.
Electron. Colloquium Comput. Complex.
Scott Aaronson, Guy N. Rothblum
2019 A* conf
Gentle measurement of quantum states and differential privacy.
STOC
Scott Aaronson, Guy N. Rothblum
2019 — conf
Incrementally Verifiable Computation via Incremental PCPs.
TCC (2)
Moni Naor, Omer Paneth, Guy N. Rothblum
2019 J jnl
Incrementally Verifiable Computation via Incremental PCPs.
IACR Cryptol. ePrint Arch.
Moni Naor, Omer Paneth, Guy N. Rothblum
2019 A* conf
Learning from Outcomes: Evidence-Based Rankings.
FOCS
Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
2019 J jnl
On Prover-Efficient Public-Coin Emulation of Interactive Proofs.
Electron. Colloquium Comput. Complex.
Gal Arnon, Guy N. Rothblum
2019 J jnl
PPAD-Hardness via Iterated Squaring Modulo a Composite.
IACR Cryptol. ePrint Arch.
Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum
2019 J jnl
Preference-Informed Fairness.
CoRR
Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona
2018 A* conf
Composable and versatile privacy via truncated CDP.
STOC
Mark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke
2018 J jnl
Constant-round interactive proof systems for AC0[2] and NC1.
Electron. Colloquium Comput. Complex.
Oded Goldreich, Guy N. Rothblum
2018 J jnl
Counting
Electron. Colloquium Comput. Complex.
Oded Goldreich, Guy N. Rothblum
2018 A* conf
Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems.
FOCS
Oded Goldreich, Guy N. Rothblum
2018 A conf
Efficient Batch Verification for UP.
CCC
Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2018 J jnl
Efficient Batch Verification for UP.
Electron. Colloquium Comput. Complex.
Omer Reingold, Guy N. Rothblum, Ron Rothblum
2018 A* conf
Fairness Through Computationally-Bounded Awareness.
NeurIPS
Michael P. Kim, Omer Reingold, Guy N. Rothblum
2018 J jnl
Fairness Through Computationally-Bounded Awareness.
CoRR
Michael P. Kim, Omer Reingold, Guy N. Rothblum
2018 J jnl
Fiat-Shamir From Simpler Assumptions.
IACR Cryptol. ePrint Arch.
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum
2018 J jnl
Fine-grained Complexity Meets IP = PSPACE.
CoRR
Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein
2018 A* conf
Multicalibration: Calibration for the (Computationally-Identifiable) Masses.
ICML
Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum
2018 A* conf
Probably Approximately Metric-Fair Learning.
ICML
Gal Yona, Guy N. Rothblum
2018 J jnl
Probably Approximately Metric-Fair Learning.
CoRR
Guy N. Rothblum, Gal Yona
2018 A conf
Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets.
ITCS
Oded Goldreich, Guy N. Rothblum
2017 J jnl
Calibration for the (Computationally-Identifiable) Masses.
CoRR
Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum
2017 J jnl
Delegating Computation: Interactive Proofs for Muggles.
Electron. Colloquium Comput. Complex.
Shafi Goldwasser, Guy N. Rothblum, Yael Tauman Kalai
2017 — conf
From Obfuscation to the Security of Fiat-Shamir for Proofs.
CRYPTO (2)
Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum
2017 J jnl
Obfuscating Conjunctions.
J. Cryptol.
Zvika Brakerski, Guy N. Rothblum
2017 J jnl
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments.
IACR Cryptol. ePrint Arch.
Omer Paneth, Guy N. Rothblum
2017 — conf
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments.
TCC (2)
Omer Paneth, Guy N. Rothblum
2017 J jnl
Simple doubly-efficient interactive proof systems for locally-characterizable sets.
Electron. Colloquium Comput. Complex.
Oded Goldreich, Guy N. Rothblum
2017 J jnl
Worst-case to Average-case reductions for subclasses of P.
Electron. Colloquium Comput. Complex.
Oded Goldreich, Guy N. Rothblum
2016 J jnl
Concentrated Differential Privacy.
CoRR
Cynthia Dwork, Guy N. Rothblum
2016 J jnl
Constant-Round Interactive Proofs for Delegating Computation.
Electron. Colloquium Comput. Complex.
Omer Reingold, Ron Rothblum, Guy N. Rothblum
2016 A* conf
Constant-round interactive proofs for delegating computation.
STOC
Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2016 J jnl
From Obfuscation to the Security of Fiat-Shamir for Proofs.
IACR Cryptol. ePrint Arch.
Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum
2016 — conf
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems.
CRYPTO (3)
Cynthia Dwork, Moni Naor, Guy N. Rothblum
2016 J jnl
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems.
Electron. Colloquium Comput. Complex.
Cynthia Dwork, Moni Naor, Guy N. Rothblum
2016 J jnl
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems.
IACR Cryptol. ePrint Arch.
Cynthia Dwork, Moni Naor, Guy N. Rothblum
2015 J jnl
Delegating Computation: Interactive Proofs for Muggles.
J. ACM
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum
2015 J jnl
How to Compute in the Presence of Leakage.
SIAM J. Comput.
Shafi Goldwasser, Guy N. Rothblum
2015 — conf
Pure Differential Privacy for Rectangle Queries via Private Partitions.
ASIACRYPT (2)
Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum
2014 A conf
Black-box obfuscation for d-CNFs.
ITCS
Zvika Brakerski, Guy N. Rothblum
2014 — conf
Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract).
ICALP (1)
Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
2014 J jnl
On Best-Possible Obfuscation.
J. Cryptol.
Shafi Goldwasser, Guy N. Rothblum
2014 J jnl
Publicly Verifiable Non-Interactive Arguments for Delegating Computation.
IACR Cryptol. ePrint Arch.
Omer Paneth, Guy N. Rothblum
2014 B conf
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding.
TCC
Zvika Brakerski, Guy N. Rothblum
2013 J jnl
Black-Box Obfuscation for d-CNFs.
IACR Cryptol. ePrint Arch.
Zvika Brakerski, Guy N. Rothblum
2013 A* conf
Interactive proofs of proximity: delegating computation in sublinear time.
STOC
Guy N. Rothblum, Salil P. Vadhan, Avi Wigderson
2013 — conf
Obfuscating Conjunctions.
CRYPTO (2)
Zvika Brakerski, Guy N. Rothblum
2013 J jnl
Obfuscating Conjunctions.
IACR Cryptol. ePrint Arch.
Zvika Brakerski, Guy N. Rothblum
2013 J jnl
Refereed delegation of computation.
Inf. Comput.
Ran Canetti, Ben Riva, Guy N. Rothblum
2013 J jnl
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding.
IACR Cryptol. ePrint Arch.
Zvika Brakerski, Guy N. Rothblum
2012 A* conf
How to Compute in the Presence of Leakage.
FOCS
Shafi Goldwasser, Guy N. Rothblum
2012 J jnl
How to Compute in the Presence of Leakage.
Electron. Colloquium Comput. Complex.
Shafi Goldwasser, Guy N. Rothblum
2012 A* conf
How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware.
CRYPTO
Guy N. Rothblum
2012 A* conf
Private data release via learning thresholds.
SODA
Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio
2012 — conf
Two Protocols for Delegation of Computation.
ICITS
Ran Canetti, Ben Riva, Guy N. Rothblum
2011 A conf
On Approximating the Entropy of Polynomial Mappings.
ICS
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan
2011 A* conf
Practical delegation of computation using multiple servers.
CCS
Ran Canetti, Ben Riva, Guy N. Rothblum
2011 J jnl
Private Data Release via Learning Thresholds
CoRR
Moritz Hardt, Guy N. Rothblum, Rocco A. Servedio
2011 A conf
Program Obfuscation with Leaky Hardware.
ASIACRYPT
Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum
2011 J jnl
Program Obfuscation with Leaky Hardware.
IACR Cryptol. ePrint Arch.
Nir Bitansky, Ran Canetti, Shafi Goldwasser, Shai Halevi, Yael Tauman Kalai, Guy N. Rothblum
2011 J jnl
Securely Obfuscating Re-Encryption.
J. Cryptol.
Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan
2011 J jnl
Two 1-Round Protocols for Delegation of Computation.
IACR Cryptol. ePrint Arch.
Ran Canetti, Ben Riva, Guy N. Rothblum
2010 A* conf
A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis.
FOCS
Moritz Hardt, Guy N. Rothblum
2010 J jnl
Are PCPs Inherent in Efficient Arguments?
Comput. Complex.
Guy N. Rothblum, Salil P. Vadhan
2010 A* conf
Boosting and Differential Privacy.
FOCS
Cynthia Dwork, Guy N. Rothblum, Salil P. Vadhan
2010 A* conf
Differential privacy under continual observation.
STOC
Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum
2010 B conf
Leakage-Resilient Signatures.
TCC
Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy N. Rothblum
2010 B conf
Obfuscation of Hyperplane Membership.
TCC
Ran Canetti, Guy N. Rothblum, Mayank Varia
2010 J jnl
On Approximating the Entropy of Polynomial Mappings.
Electron. Colloquium Comput. Complex.
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan
2010 A conf
Pan-Private Streaming Algorithms.
ICS
Cynthia Dwork, Moni Naor, Toniann Pitassi, Guy N. Rothblum, Sergey Yekhanin
2010 A* conf
Securing Computation against Continuous Leakage.
CRYPTO
Shafi Goldwasser, Guy N. Rothblum
2009 A conf
Are PCPs Inherent in Efficient Arguments?
CCC
Guy N. Rothblum, Salil P. Vadhan
2009 J jnl
Are PCPs Inherent in Efficient Arguments?
Electron. Colloquium Comput. Complex.
Guy N. Rothblum, Salil P. Vadhan
2009 J jnl
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.
Theory Comput. Syst.
Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
2009 — —
Delegating computation reliably: paradigms and constructions.
Guy N. Rothblum
2009 B conf
How Efficient Can Memory Checking Be?.
TCC
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod Vaikuntanathan
2009 J jnl
Leakage-Resilient Signatures.
IACR Cryptol. ePrint Arch.
Sebastian Faust, Eike Kiltz, Krzysztof Pietrzak, Guy N. Rothblum
2009 A* conf
On the complexity of differentially private data release: efficient algorithms and hardness results.
STOC
Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, Salil P. Vadhan
2009 J jnl
The complexity of online memory checking.
J. ACM
Moni Naor, Guy N. Rothblum
2009 B conf
Weak Verifiable Random Functions.
TCC
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum, Vinod Vaikuntanathan
2008 A* conf
A (de)constructive approach to program checking.
STOC
Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum
2008 A* conf
Delegating computation: interactive proofs for muggles.
STOC
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum
2008 A* conf
One-Time Programs.
CRYPTO
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum
2008 — conf
The Complexity of Local List Decoding.
APPROX-RANDOM
Dan Gutfreund, Guy N. Rothblum
2008 J jnl
The Complexity of Local List Decoding.
Electron. Colloquium Comput. Complex.
Dan Gutfreund, Guy N. Rothblum
2007 J jnl
A (De)constructive Approach to Program Checking.
Electron. Colloquium Comput. Complex.
Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum
2007 Misc conf
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.
FUN
Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
2007 B conf
On Best-Possible Obfuscation.
TCC
Shafi Goldwasser, Guy N. Rothblum
2007 B conf
Securely Obfuscating Re-encryption.
TCC
Susan Hohenberger, Guy N. Rothblum, Abhi Shelat, Vinod Vaikuntanathan
2007 A* conf
Verifying and decoding in constant depth.
STOC
Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum
2006 A* conf
Learning to impersonate.
ICML
Moni Naor, Guy N. Rothblum
2006 J jnl
The Complexity of Online Memory Checking.
Electron. Colloquium Comput. Complex.
Moni Naor, Guy N. Rothblum
2006 J jnl
The Complexity of Online Memory Checking.
IACR Cryptol. ePrint Arch.
Moni Naor, Guy N. Rothblum
2005 A* conf
The Complexity of Online Memory Checking.
FOCS
Moni Naor, Guy N. Rothblum
2004 J jnl
Selection from Structured Data Sets
Electron. Colloquium Comput. Complex.
Erez Petrank, Guy N. Rothblum