| Publication | Date of Publication | Type |
|---|
| STIR: Reed-Solomon proximity testing with fewer queries | 2025-01-10 | Paper |
| Secure distributed network optimization against eavesdroppers | 2024-09-25 | Paper |
| Rogue-instance security for batch knowledge proofs | 2024-08-01 | Paper |
| Hardness of approximation for stochastic problems via interactive oracle proofs | 2024-07-05 | Paper |
| Adversarial laws of large numbers and optimal regret in online classification | 2023-11-14 | Paper |
| A toolbox for barriers on interactive oracle proofs | 2023-08-14 | Paper |
| Lower bound on SNARGs in the random oracle model | 2023-06-30 | Paper |
| One-Way Functions and (Im)perfect Obfuscation | 2023-04-04 | Paper |
| Tight security bounds for Micali's SNARGs | 2023-03-31 | Paper |
| Interactive proofs for social graphs | 2022-12-07 | Paper |
| A PCP theorem for interactive proofs and applications | 2022-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5091249 | 2022-07-21 | Paper |
| Congested clique algorithms for graph spanners | 2022-07-21 | Paper |
| Subquadratic SNARGs in the random oracle model | 2022-03-31 | Paper |
| A Framework for Adversarially Robust Streaming Algorithms | 2022-03-31 | Paper |
| Barriers for succinct arguments in the random oracle model | 2022-03-23 | Paper |
| Transparent error correcting in a computationally bounded world | 2022-03-23 | Paper |
| The power of distributed verifiers in interactive proofs | 2021-02-02 | Paper |
| Secure Distributed Computing Made (Nearly) Optimal | 2021-01-20 | Paper |
| Hardness of continuous local search: query complexity and cryptographic lower bounds | 2020-12-04 | Paper |
| White-box vs. black-box complexity of search problems: Ramsey and graph property testing | 2020-02-11 | Paper |
| Distributional collision resistance beyond one-way functions | 2020-02-04 | Paper |
| Low congestion cycle covers and their applications | 2019-10-15 | Paper |
| Distributed algorithms made secure: a graph theoretic approach | 2019-10-15 | Paper |
| On distributional collision resistant hashing | 2018-09-26 | Paper |
| How to Share a Secret, Infinitely | 2018-09-14 | Paper |
| Hardness of continuous local search: query complexity and cryptographic lower bounds | 2018-07-16 | Paper |
| Another step towards realizing random oracles: non-malleable point obfuscation | 2018-07-09 | Paper |
| Collision resistant hashing for paranoids: dealing with multiple collisions | 2018-07-09 | Paper |
| The journey from NP to TFNP hardness | 2018-05-03 | Paper |
| Functional encryption for randomized functionalities in the private-key setting from minimal assumptions | 2018-04-26 | Paper |
| Non-interactive multiparty computation without correlated randomness | 2018-02-23 | Paper |
| Secret-sharing for NP | 2017-05-22 | Paper |
| How to Share a Secret, Infinitely | 2016-12-22 | Paper |
| Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption | 2016-10-27 | Paper |
| Tight bounds for sliding Bloom filters | 2016-02-19 | Paper |
| Bloom filters in adversarial environments | 2015-12-10 | Paper |
| Functional encryption for randomized functionalities in the private-key setting from minimal assumptions | 2015-07-06 | Paper |
| Secret-sharing for \(\mathbf {NP}\) | 2015-01-06 | Paper |
| Sliding Bloom Filters | 2014-01-14 | Paper |
