Guy N. Rothblum

Orcid: 0000-0001-5273-6472

According to our database1, Guy N. Rothblum authored at least 90 papers between 2004 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Computationally Efficient Multi-Class Calibration.
CoRR, 2024

2023
Doubly-Efficient Interactive Proofs for Distribution Properties.
Electron. Colloquium Comput. Complex., 2023

Constant-Round Arguments from One-Way Functions.
Electron. Colloquium Comput. Complex., 2023

PINE: Efficient Norm-Bound Verification for Secret-Shared Vectors.
CoRR, 2023

Samplable Anonymous Aggregation for Private Federated Data Analysis.
CoRR, 2023

Decision-Making Under Miscalibration.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

From the Real Towards the Ideal: Risk Prediction in a Better World.
Proceedings of the 4th Symposium on Foundations of Responsible Computing, 2023

Doubley-Efficient Interactive Proofs for Distribution Properties.
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

Indistinguishable Predictions and Multi-group Fair Learning.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
Verifying The Unseen: Interactive Proofs for Label-Invariant Distribution Properties.
Electron. Colloquium Comput. Complex., 2022

On Interactive Proofs of Proximity with Proof-Oblivious Queries.
Electron. Colloquium Comput. Complex., 2022

On Fairness and Stability in Two-Sided Matchings.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

Beyond Bernoulli: Generating Random Outcomes that cannot be Distinguished from Nature.
Proceedings of the International Conference on Algorithmic Learning Theory, 29 March, 2022

2021
Addressing bias in prediction models by improving subpopulation calibration.
J. Am. Medical Informatics Assoc., 2021

Sample-Based Proofs of Proximity.
Electron. Colloquium Comput. Complex., 2021

Consider the Alternatives: Navigating Fairness-Accuracy Tradeoffs via Disqualification.
CoRR, 2021

Multi-group Agnostic PAC Learnability.
Proceedings of the 38th International Conference on Machine Learning, 2021

2020
Constant-Round Interactive Proof Systems for AC0[2] and NC1.
Proceedings of the Computational Complexity and Property Testing, 2020

Worst-Case to Average-Case Reductions for Subclasses of P.
Proceedings of the Computational Complexity and Property Testing, 2020

Batch Verification and Proofs of Proximity with Polylog Overhead.
Electron. Colloquium Comput. Complex., 2020

Batch Verification for Statistical Zero Knowledge Proofs.
Electron. Colloquium Comput. Complex., 2020

Interactive Proofs for Verifying Machine Learning.
Electron. Colloquium Comput. Complex., 2020

Outcome Indistinguishability.
Electron. Colloquium Comput. Complex., 2020

Preference-Informed Fairness.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

Abstracting Fairness: Oracles, Metrics, and Interpretability.
Proceedings of the 1st Symposium on Foundations of Responsible Computing, 2020

2019
Incrementally Verifiable Computation via Incremental PCPs.
IACR Cryptol. ePrint Arch., 2019

PPAD-Hardness via Iterated Squaring Modulo a Composite.
IACR Cryptol. ePrint Arch., 2019

Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir.
Electron. Colloquium Comput. Complex., 2019

On Prover-Efficient Public-Coin Emulation of Interactive Proofs.
Electron. Colloquium Comput. Complex., 2019

Gentle Measurement of Quantum States and Differential Privacy.
Electron. Colloquium Comput. Complex., 2019

Fiat-Shamir: from practice to theory.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Fine-grained Complexity Meets IP = PSPACE.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Learning from Outcomes: Evidence-Based Rankings.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Doubly efficient interactive proofs.
Proceedings of the Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, 2019

2018
Fiat-Shamir From Simpler Assumptions.
IACR Cryptol. ePrint Arch., 2018

Efficient Batch Verification for UP.
Electron. Colloquium Comput. Complex., 2018

Constant-round interactive proof systems for AC0[2] and NC1.
Electron. Colloquium Comput. Complex., 2018

Counting <i>t</i>-cliques: Worst-case to average-case reductions and Direct interactive proof systems.
Electron. Colloquium Comput. Complex., 2018

Composable and versatile privacy via truncated CDP.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

Fairness Through Computationally-Bounded Awareness.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

Probably Approximately Metric-Fair Learning.
Proceedings of the 35th International Conference on Machine Learning, 2018

Multicalibration: Calibration for the (Computationally-Identifiable) Masses.
Proceedings of the 35th International Conference on Machine Learning, 2018

Counting t-Cliques: Worst-Case to Average-Case Reductions and Direct Interactive Proof Systems.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
Obfuscating Conjunctions.
J. Cryptol., 2017

On Zero-Testable Homomorphic Encryption and Publicly Verifiable Non-Interactive Arguments.
IACR Cryptol. ePrint Arch., 2017

Worst-case to Average-case reductions for subclasses of P.
Electron. Colloquium Comput. Complex., 2017

Simple doubly-efficient interactive proof systems for locally-characterizable sets.
Electron. Colloquium Comput. Complex., 2017

Calibration for the (Computationally-Identifiable) Masses.
CoRR, 2017

2016
From Obfuscation to the Security of Fiat-Shamir for Proofs.
IACR Cryptol. ePrint Arch., 2016

Constant-Round Interactive Proofs for Delegating Computation.
Electron. Colloquium Comput. Complex., 2016

Spooky Interaction and its Discontents: Compilers for Succinct Two-Message Argument Systems.
Electron. Colloquium Comput. Complex., 2016

Concentrated Differential Privacy.
CoRR, 2016

2015
Delegating Computation: Interactive Proofs for Muggles.
J. ACM, 2015

Pure Differential Privacy for Rectangle Queries via Private Partitions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

2014
On Best-Possible Obfuscation.
J. Cryptol., 2014

Publicly Verifiable Non-Interactive Arguments for Delegating Computation.
IACR Cryptol. ePrint Arch., 2014

Fast Pseudorandomness for Independence and Load Balancing - (Extended Abstract).
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Refereed delegation of computation.
Inf. Comput., 2013

Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding.
IACR Cryptol. ePrint Arch., 2013

Black-Box Obfuscation for d-CNFs.
IACR Cryptol. ePrint Arch., 2013

Interactive proofs of proximity: delegating computation in sublinear time.
Proceedings of the Symposium on Theory of Computing Conference, 2013

2012
How to Compute in the Presence of Leakage.
Electron. Colloquium Comput. Complex., 2012

Private data release via learning thresholds.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Two Protocols for Delegation of Computation.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

How to Compute under ${\cal{AC}}^{\sf0}$ Leakage without Secure Hardware.
Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011
Securely Obfuscating Re-Encryption.
J. Cryptol., 2011

Two 1-Round Protocols for Delegation of Computation.
IACR Cryptol. ePrint Arch., 2011

Program Obfuscation with Leaky Hardware.
IACR Cryptol. ePrint Arch., 2011

Practical delegation of computation using multiple servers.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

2010
On Approximating the Entropy of Polynomial Mappings.
Electron. Colloquium Comput. Complex., 2010

Are PCPs Inherent in Efficient Arguments?
Comput. Complex., 2010

Obfuscation of Hyperplane Membership.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Differential privacy under continual observation.
Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

Pan-Private Streaming Algorithms.
Proceedings of the Innovations in Computer Science, 2010

A Multiplicative Weights Mechanism for Privacy-Preserving Data Analysis.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Boosting and Differential Privacy.
Proceedings of the 51th Annual IEEE Symposium on Foundations of Computer Science, 2010

Securing Computation against Continuous Leakage.
Proceedings of the Advances in Cryptology, 2010

2009
Delegating computation reliably: paradigms and constructions.
PhD thesis, 2009

Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles.
Theory Comput. Syst., 2009

The complexity of online memory checking.
J. ACM, 2009

Leakage-Resilient Signatures.
IACR Cryptol. ePrint Arch., 2009

How Efficient Can Memory Checking Be?.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

Weak Verifiable Random Functions.
Proceedings of the Theory of Cryptography, 6th Theory of Cryptography Conference, 2009

On the complexity of differentially private data release: efficient algorithms and hardness results.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
The Complexity of Local List Decoding.
Electron. Colloquium Comput. Complex., 2008

One-Time Programs.
Proceedings of the Advances in Cryptology, 2008

2007
A (De)constructive Approach to Program Checking.
Electron. Colloquium Comput. Complex., 2007

Verifying and decoding in constant depth.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006
Learning to impersonate.
Proceedings of the Machine Learning, 2006

2004
Selection from Structured Data Sets
Electron. Colloquium Comput. Complex., 2004


  Loading...