| Publication | Date of Publication | Type |
|---|
| Incompressible encryption with everlasting security | 2026-04-24 | Paper |
| Towards a white-box secure Fiat-Shamir transformation | 2026-01-28 | Paper |
| Instance compression, revisited | 2025-12-02 | Paper |
| WHIR: Reed-Solomon proximity testing with super-fast verification | 2025-12-02 | Paper |
| IOPs with inverse polynomial soundness error | 2025-08-15 | Paper |
| On exponential-time hypotheses, derandomization, and circuit lower bounds (extended abstract) | 2025-08-12 | Paper |
| White-box vs. black-box complexity of search problems: Ramsey and graph property testing | 2025-08-06 | Paper |
| One-way functions and (im)perfect obfuscation | 2025-08-05 | Paper |
| From one-time to two-round reusable multi-signatures without nested forking | 2025-07-25 | Paper |
| Security bounds for proof-carrying data from straightline extractors | 2025-07-25 | Paper |
| Untangling the security of Kilian's protocol: upper and lower bounds | 2025-07-23 | Paper |
| Hamming weight proofs of proximity with one-sided error | 2025-07-23 | Paper |
On exponential-time hypotheses, derandomization, and circuit lower bounds
Journal of the ACM | 2025-02-05 | Paper |
| 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
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Adversarial laws of large numbers and optimal regret in online classification
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
A toolbox for barriers on interactive oracle proofs
Theory of Cryptography | 2023-08-14 | Paper |
Lower bound on SNARGs in the random oracle model
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
One-Way Functions and (Im)perfect Obfuscation
SIAM Journal on Computing | 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 |
| scientific article; zbMATH DE number 7561582 (Why is no real title available?) | 2022-07-21 | Paper |
Congested clique algorithms for graph spanners
(available as arXiv preprint) | 2022-07-21 | Paper |
A Framework for Adversarially Robust Streaming Algorithms
Journal of the ACM | 2022-03-31 | Paper |
| Subquadratic SNARGs in the random oracle model | 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
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Secure Distributed Computing Made (Nearly) Optimal
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Hardness of continuous local search: query complexity and cryptographic lower bounds
SIAM Journal on Computing | 2020-12-04 | Paper |
White-box vs. black-box complexity of search problems: Ramsey and graph property testing
Journal of the ACM | 2020-02-11 | Paper |
Distributional collision resistance beyond one-way functions
(available as arXiv preprint) | 2020-02-04 | Paper |
Low congestion cycle covers and their applications
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Distributed algorithms made secure: a graph theoretic approach
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| On distributional collision resistant hashing | 2018-09-26 | Paper |
How to Share a Secret, Infinitely
IEEE Transactions on Information Theory | 2018-09-14 | Paper |
Hardness of continuous local search: query complexity and cryptographic lower bounds
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 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
Journal of Cryptology | 2018-04-26 | Paper |
| Non-interactive multiparty computation without correlated randomness | 2018-02-23 | Paper |
Secret-sharing for NP
Journal of Cryptology | 2017-05-22 | Paper |
How to Share a Secret, Infinitely
Theory of Cryptography | 2016-12-22 | Paper |
Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption
Advances in Cryptology – CRYPTO 2016 | 2016-10-27 | Paper |
Tight bounds for sliding Bloom filters
Algorithmica | 2016-02-19 | Paper |
Bloom filters in adversarial environments
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
Theory of Cryptography | 2015-07-06 | Paper |
Secret-sharing for \(\mathbf {NP}\)
Lecture Notes in Computer Science | 2015-01-06 | Paper |
Sliding Bloom Filters
Algorithms and Computation | 2014-01-14 | Paper |
