| Publication | Date of Publication | Type |
|---|
| Constant-round arguments for batch-verification and bounded-space computations from one-way functions | 2025-01-10 | Paper |
| On interactive proofs of proximity with proof-oblivious queries | 2024-09-25 | Paper |
| Decision-making under miscalibration | 2024-09-25 | Paper |
| Constant-round arguments from one-way functions | 2024-05-08 | Paper |
| scientific article; zbMATH DE number 7829309 (Why is no real title available?) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7829324 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
Indistinguishable predictions and multi-group fair learning
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Verifying the unseen: interactive proofs for label-invariant distribution properties
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Outcome indistinguishability
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| On Prover-Efficient Public-Coin Emulation of Interactive Proofs | 2023-07-03 | Paper |
scientific article; zbMATH DE number 7650364 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
Worst-Case to Average-Case Reductions for Subclasses of P
Lecture Notes in Computer Science | 2022-08-30 | Paper |
Constant-Round Interactive Proof Systems for AC0[2 and NC1]
Lecture Notes in Computer Science | 2022-08-30 | Paper |
| Batch verification for statistical zero knowledge proofs | 2022-03-23 | Paper |
| Batch verification and proofs of proximity with polylog overhead | 2022-03-23 | Paper |
Constant-round interactive proofs for delegating computation
SIAM Journal on Computing | 2021-06-29 | Paper |
| Simple doubly-efficient interactive proof systems for locally-characterizable sets | 2021-06-15 | Paper |
| scientific article; zbMATH DE number 7250162 (Why is no real title available?) | 2020-09-22 | Paper |
| Incrementally verifiable computation via incremental PCPs | 2020-04-30 | Paper |
Fiat-Shamir: from practice to theory
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Gentle measurement of quantum states and differential privacy
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Fine-grained complexity meets \(\mathrm{IP} = \mathrm{PSPACE}\)
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Composable and versatile privacy via truncated CDP
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Private data release via learning thresholds
(available as arXiv preprint) | 2019-05-10 | Paper |
| Private data release via learning thresholds | 2019-05-10 | Paper |
Delegating computation: interactive proofs for muggles
Journal of the ACM | 2018-08-02 | Paper |
| On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments | 2018-01-19 | Paper |
| From obfuscation to the security of Fiat-Shamir for proofs | 2017-11-15 | Paper |
Constant-round interactive proofs for delegating computation
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Black-box obfuscation for \(d\)-CNFs
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Obfuscating conjunctions
Journal of Cryptology | 2017-03-02 | Paper |
Spooky interaction and its discontents: compilers for succinct two-message argument systems
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Pure differential privacy for rectangle queries via private partitions
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
The complexity of online memory checking
Journal of the ACM | 2015-11-11 | Paper |
How to Compute in the Presence of Leakage
SIAM Journal on Computing | 2015-11-04 | Paper |
On the complexity of differentially private data release, efficient algorithms and hardness results
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
On best-possible obfuscation
Journal of Cryptology | 2014-09-25 | Paper |
Differential privacy under continual observation
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
Interactive proofs of proximity: delegating computation in sublinear time
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Fast pseudorandomness for independence and load balancing (extended abstract)
Automata, Languages, and Programming | 2014-07-01 | Paper |
Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
Theory of Cryptography | 2014-02-18 | Paper |
Refereed delegation of computation
Information and Computation | 2013-12-03 | Paper |
Obfuscating conjunctions
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Two protocols for delegation of computation
Lecture Notes in Computer Science | 2012-11-06 | Paper |
How to compute under \({\mathcal{AC}}^{0}\) leakage without secure hardware
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Securely obfuscating re-encryption
Journal of Cryptology | 2012-01-13 | Paper |
Program obfuscation with leaky hardware
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Are PCPs inherent in efficient arguments?
Computational Complexity | 2011-02-18 | Paper |
Securing computation against continuous leakage
Advances in Cryptology – CRYPTO 2010 | 2010-08-24 | Paper |
Leakage-resilient signatures
Theory of Cryptography | 2010-02-24 | Paper |
Obfuscation of hyperplane membership
Theory of Cryptography | 2010-02-24 | Paper |
Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles
Theory of Computing Systems | 2009-08-06 | Paper |
How Efficient Can Memory Checking Be?
Theory of Cryptography | 2009-03-03 | Paper |
Weak Verifiable Random Functions
Theory of Cryptography | 2009-03-03 | Paper |
One-Time Programs
Lecture Notes in Computer Science | 2009-02-10 | Paper |
| scientific article; zbMATH DE number 5485522 (Why is no real title available?) | 2009-01-05 | Paper |
| Verifying and decoding in constant depth | 2009-01-05 | Paper |
| scientific article; zbMATH DE number 5485525 (Why is no real title available?) | 2009-01-05 | Paper |
The Complexity of Local List Decoding
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles
Lecture Notes in Computer Science | 2007-11-15 | Paper |
On Best-Possible Obfuscation
Theory of Cryptography | 2007-08-30 | Paper |
Securely Obfuscating Re-encryption
Theory of Cryptography | 2007-08-30 | Paper |
