| 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 |
| https://portal.mardi4nfdi.de/entity/Q6126318 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126336 | 2024-04-09 | Paper |
| Indistinguishable predictions and multi-group fair learning | 2024-01-16 | Paper |
| Verifying the unseen: interactive proofs for label-invariant distribution properties | 2023-12-08 | Paper |
| Outcome indistinguishability | 2023-11-14 | Paper |
| On Prover-Efficient Public-Coin Emulation of Interactive Proofs | 2023-07-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875710 | 2023-02-03 | Paper |
| Worst-Case to Average-Case Reductions for Subclasses of P | 2022-08-30 | Paper |
| Constant-Round Interactive Proof Systems for AC0[2] and NC1 | 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 | 2021-06-29 | Paper |
| Simple doubly-efficient interactive proof systems for locally-characterizable sets | 2021-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121910 | 2020-09-22 | Paper |
| Incrementally verifiable computation via incremental PCPs | 2020-04-30 | Paper |
| Fiat-Shamir: from practice to theory | 2020-01-30 | Paper |
| Finding a Nash equilibrium is no easier than breaking Fiat-Shamir | 2020-01-30 | Paper |
| Gentle measurement of quantum states and differential privacy | 2020-01-30 | Paper |
| Fine-grained complexity meets \(\mathrm{IP} = \mathrm{PSPACE}\) | 2019-10-15 | Paper |
| Composable and versatile privacy via truncated CDP | 2019-08-22 | Paper |
| Private data release via learning thresholds | 2019-05-10 | Paper |
| Delegating computation: interactive proofs for muggles | 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 | 2017-09-29 | Paper |
| Black-box obfuscation for \(d\)-CNFs | 2017-05-19 | Paper |
| Obfuscating conjunctions | 2017-03-02 | Paper |
| Spooky interaction and its discontents: compilers for succinct two-message argument systems | 2016-11-09 | Paper |
| Pure differential privacy for rectangle queries via private partitions | 2016-03-23 | Paper |
| The complexity of online memory checking | 2015-11-11 | Paper |
| How to Compute in the Presence of Leakage | 2015-11-04 | Paper |
| On the complexity of differentially private data release, efficient algorithms and hardness results | 2015-02-04 | Paper |
| On best-possible obfuscation | 2014-09-25 | Paper |
| Differential privacy under continual observation | 2014-08-13 | Paper |
| Interactive proofs of proximity: delegating computation in sublinear time | 2014-08-07 | Paper |
| Fast pseudorandomness for independence and load balancing (extended abstract) | 2014-07-01 | Paper |
| Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding | 2014-02-18 | Paper |
| Refereed delegation of computation | 2013-12-03 | Paper |
| Obfuscating conjunctions | 2013-09-17 | Paper |
| Two protocols for delegation of computation | 2012-11-06 | Paper |
| How to compute under \({\mathcal{AC}}^{0}\) leakage without secure hardware | 2012-09-25 | Paper |
| Securely obfuscating re-encryption | 2012-01-13 | Paper |
| Program obfuscation with leaky hardware | 2011-12-02 | Paper |
| Are PCPs inherent in efficient arguments? | 2011-02-18 | Paper |
| Securing computation against continuous leakage | 2010-08-24 | Paper |
| Leakage-resilient signatures | 2010-02-24 | Paper |
| Obfuscation of hyperplane membership | 2010-02-24 | Paper |
| Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles | 2009-08-06 | Paper |
| How Efficient Can Memory Checking Be? | 2009-03-03 | Paper |
| Weak Verifiable Random Functions | 2009-03-03 | Paper |
| One-Time Programs | 2009-02-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549691 | 2009-01-05 | Paper |
| Verifying and decoding in constant depth | 2009-01-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3549694 | 2009-01-05 | Paper |
| The Complexity of Local List Decoding | 2008-11-27 | Paper |
| Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles | 2007-11-15 | Paper |
| On Best-Possible Obfuscation | 2007-08-30 | Paper |
| Securely Obfuscating Re-encryption | 2007-08-30 | Paper |
