Selection from Structured Data Sets - Erez Petrank; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2004)

Learning to impersonate. - Moni Naor; Guy N. Rothblum (ICML, 2006)

The Complexity of Online Memory Checking. - Moni Naor; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2006)

Verifying and decoding in constant depth. - Shafi Goldwasser; Dan Gutfreund; Alexander Healy; Tali Kaufman; Guy N. Rothblum (STOC, 2007)

A (De)constructive Approach to Program Checking. - Shafi Goldwasser; Dan Gutfreund; Alexander Healy; Tali Kaufman; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2007)

One-Time Programs. - Shafi Goldwasser; Yael Tauman Kalai; Guy N. Rothblum (CRYPTO, 2008)

The Complexity of Local List Decoding. - Dan Gutfreund; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2008)

On the complexity of differentially private data release: efficient algorithms and hardness results. - Cynthia Dwork; Moni Naor; Omer Reingold; Guy N. Rothblum; Salil P. Vadhan (STOC, 2009)

Weak Verifiable Random Functions. - Zvika Brakerski; Shafi Goldwasser; Guy N. Rothblum; Vinod Vaikuntanathan (TCC, 2009)

How Efficient Can Memory Checking Be?. - Cynthia Dwork; Moni Naor; Guy N. Rothblum; Vinod Vaikuntanathan (TCC, 2009)

Leakage-Resilient Signatures. - Sebastian Faust; Eike Kiltz; Krzysztof Pietrzak; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2009)

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles. - Ronen Gradwohl; Moni Naor; Benny Pinkas; Guy N. Rothblum (Theory Comput. Syst., 2009)

Delegating computation reliably: paradigms and constructions. - Guy N. Rothblum (2009)

Securing Computation against Continuous Leakage. - Shafi Goldwasser; Guy N. Rothblum (CRYPTO, 2010)

Boosting and Differential Privacy. - Cynthia Dwork; Guy N. Rothblum; Salil P. Vadhan (FOCS, 2010)

A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis. - Moritz Hardt; Guy N. Rothblum (FOCS, 2010)

Pan-Private Streaming Algorithms. - Cynthia Dwork; Moni Naor; Toniann Pitassi; Guy N. Rothblum; Sergey Yekhanin (ICS, 2010)

Differential privacy under continual observation. - Cynthia Dwork; Moni Naor; Toniann Pitassi; Guy N. Rothblum (STOC, 2010)

Obfuscation of Hyperplane Membership. - Ran Canetti; Guy N. Rothblum; Mayank Varia (TCC, 2010)

Are PCPs Inherent in Efficient Arguments? - Guy N. Rothblum; Salil P. Vadhan (Comput. Complex., 2010)

On Approximating the Entropy of Polynomial Mappings. - Zeev Dvir; Dan Gutfreund; Guy N. Rothblum; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2010)

Practical delegation of computation using multiple servers. - Ran Canetti; Ben Riva; Guy N. Rothblum (CCS, 2011)

Program Obfuscation with Leaky Hardware. - Nir Bitansky; Ran Canetti; Shafi Goldwasser; Shai Halevi; Yael Tauman Kalai; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2011)

Two 1-Round Protocols for Delegation of Computation. - Ran Canetti; Ben Riva; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2011)

Securely Obfuscating Re-Encryption. - Susan Hohenberger; Guy N. Rothblum; Abhi Shelat; Vinod Vaikuntanathan (J. Cryptol., 2011)

How to Compute under ${ cal{AC}}^{ sf0}$ Leakage without Secure Hardware. - Guy N. Rothblum (CRYPTO, 2012)

Two Protocols for Delegation of Computation. - Ran Canetti; Ben Riva; Guy N. Rothblum (ICITS, 2012)

Private data release via learning thresholds. - Moritz Hardt; Guy N. Rothblum; Rocco A. Servedio (SODA, 2012)

Interactive proofs of proximity: delegating computation in sublinear time. - Guy N. Rothblum; Salil P. Vadhan; Avi Wigderson (STOC, 2013)

Black-Box Obfuscation for d-CNFs. - Zvika Brakerski; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2013)

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding. - Zvika Brakerski; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2013)

Refereed delegation of computation. - Ran Canetti; Ben Riva; Guy N. Rothblum (Inf. Comput., 2013)

Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). - Raghu Meka; Omer Reingold; Guy N. Rothblum; Ron D. Rothblum (ICALP (1), 2014)

Publicly Verifiable Non-Interactive Arguments for Delegating Computation. - Omer Paneth; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2014)

On Best-Possible Obfuscation. - Shafi Goldwasser; Guy N. Rothblum (J. Cryptol., 2014)

Pure Differential Privacy for Rectangle Queries via Private Partitions. - Cynthia Dwork; Moni Naor; Omer Reingold; Guy N. Rothblum (ASIACRYPT (2), 2015)

How to Compute in the Presence of Leakage. - Shafi Goldwasser; Guy N. Rothblum (SIAM J. Comput., 2015)

Concentrated Differential Privacy. - Cynthia Dwork; Guy N. Rothblum (CoRR, 2016)

Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. - Cynthia Dwork; Moni Naor; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2016)

From Obfuscation to the Security of Fiat-Shamir for Proofs. - Yael Tauman Kalai; Guy N. Rothblum; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2016)

Calibration for the (Computationally-Identifiable) Masses. - Úrsula Hébert-Johnson; Michael P. Kim; Omer Reingold; Guy N. Rothblum (CoRR, 2017)

Simple doubly-efficient interactive proof systems for locally-characterizable sets. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2017)

Worst-case to Average-case reductions for subclasses of P. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2017)

Delegating Computation: Interactive Proofs for Muggles. - Shafi Goldwasser; Guy N. Rothblum; Yael Tauman Kalai (Electron. Colloquium Comput. Complex., 2017)

On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments. - Omer Paneth; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2017)

Obfuscating Conjunctions. - Zvika Brakerski; Guy N. Rothblum (J. Cryptol., 2017)

Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems. - Oded Goldreich 001; Guy N. Rothblum (FOCS, 2018)

Multicalibration: Calibration for the (Computationally-Identifiable) Masses. - Úrsula Hébert-Johnson; Michael P. Kim; Omer Reingold; Guy N. Rothblum (ICML, 2018)

Probably Approximately Metric-Fair Learning. - Gal Yona; Guy N. Rothblum (ICML, 2018)

Fairness Through Computationally-Bounded Awareness. - Michael P. Kim; Omer Reingold; Guy N. Rothblum (NeurIPS, 2018)

Composable and versatile privacy via truncated CDP. - Mark Bun; Cynthia Dwork; Guy N. Rothblum; Thomas Steinke 002 (STOC, 2018)

Counting t-cliques: Worst-case to average-case reductions and Direct interactive proof systems. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2018)

Constant-round interactive proof systems for AC0[2] and NC1. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2018)

Efficient Batch Verification for UP. - Omer Reingold; Guy N. Rothblum; Ron Rothblum (Electron. Colloquium Comput. Complex., 2018)

Fiat-Shamir From Simpler Assumptions. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Alex Lombardi; Guy N. Rothblum; Ron D. Rothblum (IACR Cryptol. ePrint Arch., 2018)

Doubly efficient interactive proofs. - Guy N. Rothblum (Providing Sound Foundations for Cryptography, 2019)

Learning from Outcomes: Evidence-Based Rankings. - Cynthia Dwork; Michael P. Kim; Omer Reingold; Guy N. Rothblum; Gal Yona (FOCS, 2019)

Fine-grained Complexity Meets IP = PSPACE. - Lijie Chen 001; Shafi Goldwasser; Kaifeng Lyu; Guy N. Rothblum; Aviad Rubinstein (SODA, 2019)

Fiat-Shamir: from practice to theory. - Ran Canetti; Yilei Chen 001; Justin Holmgren; Alex Lombardi; Guy N. Rothblum; Ron D. Rothblum; Daniel Wichs (STOC, 2019)

Gentle Measurement of Quantum States and Differential Privacy. - Scott Aaronson; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2019)

On Prover-Efficient Public-Coin Emulation of Interactive Proofs. - Gal Arnon; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2019)

Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. - Arka Rai Choudhuri; Pavel Hubácek; Chethan Kamath; Krzysztof Pietrzak; Alon Rosen; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2019)

PPAD-Hardness via Iterated Squaring Modulo a Composite. - Arka Rai Choudhuri; Pavel Hubácek; Chethan Kamath; Krzysztof Pietrzak; Alon Rosen; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2019)

Incrementally Verifiable Computation via Incremental PCPs. - Moni Naor; Omer Paneth; Guy N. Rothblum (IACR Cryptol. ePrint Arch., 2019)

Abstracting Fairness: Oracles, Metrics, and Interpretability. - Cynthia Dwork; Christina Ilvento; Guy N. Rothblum; Pragya Sur (FORC, 2020)

Preference-Informed Fairness. - Michael P. Kim; Aleksandra Korolova; Guy N. Rothblum; Gal Yona (ITCS, 2020)

Outcome Indistinguishability. - Cynthia Dwork; Michael P. Kim; Omer Reingold; Guy N. Rothblum; Gal Yona (Electron. Colloquium Comput. Complex., 2020)

Interactive Proofs for Verifying Machine Learning. - Shafi Goldwasser; Guy N. Rothblum; Jonathan Shafer; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2020)

Batch Verification for Statistical Zero Knowledge Proofs. - Inbar Kaslasi; Prashant Nalini Vasudevan; Guy N. Rothblum; Ron Rothblum; Adam Sealfon (Electron. Colloquium Comput. Complex., 2020)

Batch Verification and Proofs of Proximity with Polylog Overhead. - Guy N. Rothblum; Ron Rothblum (Electron. Colloquium Comput. Complex., 2020)

Worst-Case to Average-Case Reductions for Subclasses of P. - Oded Goldreich 001; Guy N. Rothblum (Computational Complexity and Property Testing, 2020)

Constant-Round Interactive Proof Systems for AC0[2] and NC1. - Oded Goldreich 001; Guy N. Rothblum (Computational Complexity and Property Testing, 2020)

Multi-group Agnostic PAC Learnability. - Guy N. Rothblum; Gal Yona (ICML, 2021)

Consider the Alternatives: Navigating Fairness-Accuracy Tradeoffs via Disqualification. - Guy N. Rothblum; Gal Yona (CoRR, 2021)

Sample-Based Proofs of Proximity. - Guy Goldberg; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2021)

Addressing bias in prediction models by improving subpopulation calibration. - Noam Barda; Gal Yona; Guy N. Rothblum; Philip Greenland; Morton Leibowitz; Ran D. Balicer; Eitan Bachmat; Noa Dagan (J. Am. Medical Informatics Assoc., 2021)

Constant-Round Interactive Proofs for Delegating Computation. - Omer Reingold; Guy N. Rothblum; Ron D. Rothblum (SIAM J. Comput., 2021)

Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature. - Cynthia Dwork; Michael P. Kim; Omer Reingold; Guy N. Rothblum; Gal Yona (ALT, 2022)

On Fairness and Stability in Two-Sided Matchings. - Gili Karni; Guy N. Rothblum; Gal Yona (ITCS, 2022)

On Interactive Proofs of Proximity with Proof-Oblivious Queries. - Oded Goldreich 001; Guy N. Rothblum; Tal Skverer (Electron. Colloquium Comput. Complex., 2022)

Verifying The Unseen: Interactive Proofs for Label-Invariant Distribution Properties. - Tal Herman; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2022)

Indistinguishable Predictions and Multi-group Fair Learning. - Guy N. Rothblum (EUROCRYPT (1), 2023)

Doubley-Efficient Interactive Proofs for Distribution Properties. - Tal Herman; Guy N. Rothblum (FOCS, 2023)

From the Real Towards the Ideal: Risk Prediction in a Better World. - Cynthia Dwork; Omer Reingold; Guy N. Rothblum (FORC, 2023)

Decision-Making Under Miscalibration. - Guy N. Rothblum; Gal Yona (ITCS, 2023)

Samplable Anonymous Aggregation for Private Federated Data Analysis. - 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; et al. (CoRR, 2023)

PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors. - Guy N. Rothblum; Eran Omri; Junye Chen; Kunal Talwar (CoRR, 2023)

Constant-Round Arguments from One-Way Functions. - Noga Amit; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2023)

Doubly-Efficient Interactive Proofs for Distribution Properties. - Tal Herman; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2023)

Samplable Anonymous Aggregation for Private Federated Data Analysis. - 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; et al. (CCS, 2024)

On Computationally Efficient Multi-Class Calibration. - Parikshit Gopalan; Lunjia Hu; Guy N. Rothblum (COLT, 2024)

PINE: Efficient Verification of a Euclidean Norm Bound of a Secret-Shared Vector. - Guy N. Rothblum; Eran Omri; Junye Chen; Kunal Talwar (USENIX Security Symposium, 2024)

Scalable Private Search with Wally. - Hilal Asi; Fabian Boemer; Nicholas Genise; Muhammad Haris Mughees; Tabitha Ogilvie; Rehan Rishi; Guy N. Rothblum; Kunal Talwar; Karl Tarbe; Ruiyu Zhu; Marco Zuliani (CoRR, 2024)

Doubly Sub-linear Interactive Proofs of Proximity. - Noga Amir; Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2024)

Models That Prove Their Own Correctness. - Noga Amit; Orr Paradise; Guy N. Rothblum; Shafi Goldwasser (Electron. Colloquium Comput. Complex., 2024)

Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. - Noga Amit; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2024)

Interactive Proofs for General Distribution Properties. - Tal Herman; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2024)

How to Verify Any (Reasonable) Distribution Property: Computationally Sound Argument Systems for Distributions. - Tal Herman; Guy N. Rothblum (ICLR, 2025)

Location-Invariant Properties of Functions versus Properties of Distributions: United in Testing but Separated in Verification. - Oded Goldreich 001; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2025)

PREAMBLE: Private and Efficient Aggregation of Block Sparse Vectors and Applications. - Hilal Asi; Vitaly Feldman; Hannah Keller; Guy N. Rothblum; Kunal Talwar (IACR Cryptol. ePrint Arch., 2025)

Local Pan-Privacy for Federated Analytics. - Vitaly Feldman; Audra McMillan; Guy N. Rothblum; Kunal Talwar (CoRR, 2025)

Accuracy vs. Accuracy: Computational Tradeoffs Between Classification Rates and Utility. - Noga Amit; Omer Reingold; Guy N. Rothblum (CoRR, 2025)

On the Impossibility of Separating Intelligence from Judgment: The Computational Intractability of Filtering for AI Alignment. - Sarah Ball; Greg Gluch; Shafi Goldwasser; Frauke Kreuter; Omer Reingold; Guy N. Rothblum (CoRR, 2025)