Guy N. Rothblum

ORCID

Publication Activity (10 Years)

Years Active: 2004-2024
Publications (10 Years): 91

Top Venues

Electron. Colloquium Comput. Complex.

CoRR

IACR Cryptol. ePrint Arch.

STOC

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Noga Amit, Guy N. Rothblum
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. IACR Cryptol. ePrint Arch. 2024 (2024)
Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum
On Computationally Efficient Multi-Class Calibration. CoRR (2024)
Noga Amit, Guy N. Rothblum
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. CRYPTO (10) (2024)
Noga Amit, Orr Paradise, Guy N. Rothblum, Shafi Goldwasser
Models That Prove Their Own Correctness. Electron. Colloquium Comput. Complex. (2024)
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 (2024)
Noga Amit, Shafi Goldwasser, Orr Paradise, Guy N. Rothblum
Models That Prove Their Own Correctness. CoRR (2024)
Tal Herman, Guy N. Rothblum
Interactive Proofs for General Distribution Properties. Electron. Colloquium Comput. Complex. (2024)
Noga Amit, Guy N. Rothblum
Constant-Round Arguments for Batch-Verification and Bounded-Space Computations from One-Way Functions. Electron. Colloquium Comput. Complex. (2024)
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)
Parikshit Gopalan, Lunjia Hu, Guy N. Rothblum
On Computationally Efficient Multi-Class Calibration. COLT (2024)
Noga Amit, Guy N. Rothblum
Constant-Round Arguments from One-Way Functions. STOC (2023)
Tal Herman, Guy N. Rothblum
Doubley-Efficient Interactive Proofs for Distribution Properties. FOCS (2023)
Noga Amit, Guy N. Rothblum
Constant-Round Arguments from One-Way Functions. Electron. Colloquium Comput. Complex. (2023)
Guy N. Rothblum, Eran Omri, Junye Chen, Kunal Talwar
PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors. CoRR (2023)
Noga Amit, Guy N. Rothblum
Constant-Round Arguments from One-Way Functions. IACR Cryptol. ePrint Arch. 2023 (2023)
Guy N. Rothblum, Gal Yona
Decision-Making Under Miscalibration. ITCS (2023)
Guy N. Rothblum
Indistinguishable Predictions and Multi-group Fair Learning. EUROCRYPT (1) (2023)
Tal Herman, Guy N. Rothblum
Doubly-Efficient Interactive Proofs for Distribution Properties. Electron. Colloquium Comput. Complex. (2023)
Oded Goldreich, Guy N. Rothblum, Tal Skverer
On Interactive Proofs of Proximity with Proof-Oblivious Queries. ITCS (2023)
Cynthia Dwork, Omer Reingold, Guy N. Rothblum
From the Real Towards the Ideal: Risk Prediction in a Better World. FORC (2023)
Guy Goldberg, Guy N. Rothblum
Sample-Based Proofs of Proximity. ITCS (2022)
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)
Oded Goldreich, Guy N. Rothblum, Tal Skverer
On Interactive Proofs of Proximity with Proof-Oblivious Queries. Electron. Colloquium Comput. Complex. (2022)
Tal Herman, Guy N. Rothblum
Verifying The Unseen: Interactive Proofs for Label-Invariant Distribution Properties. Electron. Colloquium Comput. Complex. (2022)
Guy N. Rothblum, Gal Yona
Decision-Making under Miscalibration. CoRR (2022)
Tal Herman, Guy N. Rothblum
Verifying the unseen: interactive proofs for label-invariant distribution properties. STOC (2022)
Gili Karni, Guy N. Rothblum, Gal Yona
On Fairness and Stability in Two-Sided Matchings. ITCS (2022)
Guy Goldberg, Guy N. Rothblum
Sample-Based Proofs of Proximity. Electron. Colloquium Comput. Complex. 28 (2021)
Guy N. Rothblum, Gal Yona
Multi-group Agnostic PAC Learnability. CoRR (2021)
Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
Constant-Round Interactive Proofs for Delegating Computation. SIAM J. Comput. 50 (3) (2021)
Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
Outcome indistinguishability. STOC (2021)
Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff
Interactive Proofs for Verifying Machine Learning. ITCS (2021)
Guy N. Rothblum, Gal Yona
Consider the Alternatives: Navigating Fairness-Accuracy Tradeoffs via Disqualification. CoRR (2021)
Gili Karni, Guy N. Rothblum, Gal Yona
On Fairness and Stability in Two-Sided Matchings. CoRR (2021)
Noam Barda, Gal Yona, Guy N. Rothblum, Philip Greenland, Morton Leibowitz, Ran D. Balicer, Eitan Bachmat, Noa Dagan
Addressing bias in prediction models by improving subpopulation calibration. J. Am. Medical Informatics Assoc. 28 (3) (2021)
Guy N. Rothblum, Gal Yona
Multi-group Agnostic PAC Learnability. ICML (2021)
Gal Arnon, Guy N. Rothblum
On Prover-Efficient Public-Coin Emulation of Interactive Proofs. ITC (2021)
Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona
Preference-Informed Fairness. ITCS (2020)
Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona
Preference-informed fairness. FAT* (2020)
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 (2020)
Guy N. Rothblum, Ron Rothblum
Batch Verification and Proofs of Proximity with Polylog Overhead. Electron. Colloquium Comput. Complex. 27 (2020)
Guy N. Rothblum, Ron D. Rothblum
Batch Verification and Proofs of Proximity with Polylog Overhead. TCC (2) (2020)
Shafi Goldwasser, Guy N. Rothblum, Jonathan Shafer, Amir Yehudayoff
Interactive Proofs for Verifying Machine Learning. Electron. Colloquium Comput. Complex. 27 (2020)
Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
Outcome Indistinguishability. Electron. Colloquium Comput. Complex. 27 (2020)
Inbar Kaslasi, Guy N. Rothblum, Ron D. Rothblum, Adam Sealfon, Prashant Nalini Vasudevan
Batch Verification for Statistical Zero Knowledge Proofs. TCC (2) (2020)
Cynthia Dwork, Christina Ilvento, Guy N. Rothblum, Pragya Sur
Abstracting Fairness: Oracles, Metrics, and Interpretability. CoRR (2020)
Cynthia Dwork, Christina Ilvento, Guy N. Rothblum, Pragya Sur
Abstracting Fairness: Oracles, Metrics, and Interpretability. FORC (2020)
Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
Outcome Indistinguishability. CoRR (2020)
Inbar Kaslasi, Prashant Nalini Vasudevan, Guy N. Rothblum, Ron Rothblum, Adam Sealfon
Batch Verification for Statistical Zero Knowledge Proofs. Electron. Colloquium Comput. Complex. 27 (2020)
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. STOC (2019)
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 (2019)
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. 26 (2019)
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 (2019)
Moni Naor, Omer Paneth, Guy N. Rothblum
Incrementally Verifiable Computation via Incremental PCPs. IACR Cryptol. ePrint Arch. 2019 (2019)
Scott Aaronson, Guy N. Rothblum
Gentle measurement of quantum states and differential privacy. STOC (2019)
Michael P. Kim, Aleksandra Korolova, Guy N. Rothblum, Gal Yona
Preference-Informed Fairness. CoRR (2019)
Cynthia Dwork, Michael P. Kim, Omer Reingold, Guy N. Rothblum, Gal Yona
Learning from Outcomes: Evidence-Based Rankings. FOCS (2019)
Moni Naor, Omer Paneth, Guy N. Rothblum
Incrementally Verifiable Computation via Incremental PCPs. TCC (2) (2019)
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum, Daniel Wichs
Fiat-Shamir: from practice to theory. STOC (2019)
Gal Arnon, Guy N. Rothblum
On Prover-Efficient Public-Coin Emulation of Interactive Proofs. Electron. Colloquium Comput. Complex. 26 (2019)
Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein
Fine-grained Complexity Meets IP = PSPACE. SODA (2019)
Scott Aaronson, Guy N. Rothblum
Gentle Measurement of Quantum States and Differential Privacy. Electron. Colloquium Comput. Complex. 26 (2019)
Lijie Chen, Shafi Goldwasser, Kaifeng Lyu, Guy N. Rothblum, Aviad Rubinstein
Fine-grained Complexity Meets IP = PSPACE. CoRR (2018)
Mark Bun, Cynthia Dwork, Guy N. Rothblum, Thomas Steinke
Composable and versatile privacy via truncated CDP. STOC (2018)
Michael P. Kim, Omer Reingold, Guy N. Rothblum
Fairness Through Computationally-Bounded Awareness. CoRR (2018)
Guy N. Rothblum, Gal Yona
Probably Approximately Metric-Fair Learning. CoRR (2018)
Gal Yona, Guy N. Rothblum
Probably Approximately Metric-Fair Learning. ICML (2018)
Oded Goldreich, Guy N. Rothblum
Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems. FOCS (2018)
Omer Reingold, Guy N. Rothblum, Ron Rothblum
Efficient Batch Verification for UP. Electron. Colloquium Comput. Complex. 25 (2018)
Ran Canetti, Yilei Chen, Justin Holmgren, Alex Lombardi, Guy N. Rothblum, Ron D. Rothblum
Fiat-Shamir From Simpler Assumptions. IACR Cryptol. ePrint Arch. 2018 (2018)
Oded Goldreich, Guy N. Rothblum
Simple Doubly-Efficient Interactive Proof Systems for Locally-Characterizable Sets. ITCS (2018)
Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum
Multicalibration: Calibration for the (Computationally-Identifiable) Masses. ICML (2018)
Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
Efficient Batch Verification for UP. Computational Complexity Conference (2018)
Oded Goldreich, Guy N. Rothblum
Constant-round interactive proof systems for AC0[2] and NC1. Electron. Colloquium Comput. Complex. 25 (2018)
Michael P. Kim, Omer Reingold, Guy N. Rothblum
Fairness Through Computationally-Bounded Awareness. NeurIPS (2018)
Oded Goldreich, Guy N. Rothblum
-cliques: Worst-case to average-case reductions and Direct interactive proof systems. Electron. Colloquium Comput. Complex. 25 (2018)
Zvika Brakerski, Guy N. Rothblum
Obfuscating Conjunctions. J. Cryptol. 30 (1) (2017)
Oded Goldreich, Guy N. Rothblum
Simple doubly-efficient interactive proof systems for locally-characterizable sets. Electron. Colloquium Comput. Complex. 24 (2017)
Shafi Goldwasser, Guy N. Rothblum, Yael Tauman Kalai
Delegating Computation: Interactive Proofs for Muggles. Electron. Colloquium Comput. Complex. 24 (2017)
Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum
From Obfuscation to the Security of Fiat-Shamir for Proofs. CRYPTO (2) (2017)
Omer Paneth, Guy N. Rothblum
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-interactive Arguments. TCC (2) (2017)
Úrsula Hébert-Johnson, Michael P. Kim, Omer Reingold, Guy N. Rothblum
Calibration for the (Computationally-Identifiable) Masses. CoRR (2017)
Omer Paneth, Guy N. Rothblum
On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments. IACR Cryptol. ePrint Arch. 2017 (2017)
Oded Goldreich, Guy N. Rothblum
Worst-case to Average-case reductions for subclasses of P. Electron. Colloquium Comput. Complex. 24 (2017)
Cynthia Dwork, Moni Naor, Guy N. Rothblum
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. IACR Cryptol. ePrint Arch. 2016 (2016)
Cynthia Dwork, Moni Naor, Guy N. Rothblum
Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems. Electron. Colloquium Comput. Complex. 23 (2016)
Cynthia Dwork, Guy N. Rothblum
Concentrated Differential Privacy. CoRR (2016)
Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
Constant-round interactive proofs for delegating computation. STOC (2016)
Yael Tauman Kalai, Guy N. Rothblum, Ron D. Rothblum
From Obfuscation to the Security of Fiat-Shamir for Proofs. IACR Cryptol. ePrint Arch. 2016 (2016)
Cynthia Dwork, Moni Naor, Guy N. Rothblum
Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems. CRYPTO (3) (2016)
Omer Reingold, Ron Rothblum, Guy N. Rothblum
Constant-Round Interactive Proofs for Delegating Computation. Electron. Colloquium Comput. Complex. 23 (2016)
Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum
Pure Differential Privacy for Rectangle Queries via Private Partitions. ASIACRYPT (2) (2015)
Shafi Goldwasser, Guy N. Rothblum
How to Compute in the Presence of Leakage. SIAM J. Comput. 44 (5) (2015)
Shafi Goldwasser, Yael Tauman Kalai, Guy N. Rothblum
Delegating Computation: Interactive Proofs for Muggles. J. ACM 62 (4) (2015)
Omer Paneth, Guy N. Rothblum
Publicly Verifiable Non-Interactive Arguments for Delegating Computation. IACR Cryptol. ePrint Arch. 2014 (2014)
Shafi Goldwasser, Guy N. Rothblum
On Best-Possible Obfuscation. J. Cryptol. 27 (3) (2014)
Zvika Brakerski, Guy N. Rothblum
Black-box obfuscation for d-CNFs. ITCS (2014)
Raghu Meka, Omer Reingold, Guy N. Rothblum, Ron D. Rothblum
Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract). ICALP (1) (2014)
Zvika Brakerski, Guy N. Rothblum
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding. TCC (2014)
Zvika Brakerski, Guy N. Rothblum
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding. IACR Cryptol. ePrint Arch. 2013 (2013)

Guy N. Rothblum.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guy N. Rothblum