| Publication | Date of Publication | Type |
|---|
| Uniform black-box separations via non-malleable extractors | 2026-02-04 | Paper |
| (Inefficient prover) ZAPs from hard-to-invert functions | 2025-12-02 | Paper |
| Extracting randomness from samplable distributions, revisited | 2025-08-15 | Paper |
| Kolmogorov comes to cryptomania: on interactive Kolmogorov complexity and key-agreement | 2025-08-15 | Paper |
| Non-malleable codes for small-depth circuits | 2025-08-12 | Paper |
| Towards permissionless consensus in the standard model via fine-grained complexity | 2024-12-04 | Paper |
| Non-malleable codes with optimal rate for poly-size circuits | 2024-11-13 | Paper |
| Immunizing backdoored PRGs | 2024-08-02 | Paper |
| Towards topology-hiding computation from oblivious transfer | 2024-08-01 | Paper |
| A note on the complexity of private simultaneous messages with many parties | 2024-06-25 | Paper |
| scientific article; zbMATH DE number 7829244 (Why is no real title available?) | 2024-04-09 | Paper |
New ways to garble arithmetic circuits
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-08 | Paper |
Correction to: ``Topology-hiding communication from minimal assumptions''
Journal of Cryptology | 2023-10-25 | Paper |
| Communication complexity with defective randomness | 2023-07-12 | Paper |
| Linear Threshold Secret-Sharing with Binary Reconstruction | 2023-07-03 | Paper |
(Nondeterministic) hardness vs. non-malleability
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
| Cryptography from Information Loss. | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650434 (Why is no real title available?) | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7650428 (Why is no real title available?) | 2023-02-03 | Paper |
| Non-malleability against polynomial tampering | 2022-12-07 | Paper |
| New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust | 2022-12-07 | Paper |
| Topology-hiding communication from minimal assumptions | 2022-03-23 | Paper |
| Non-malleable codes for decision trees | 2020-05-20 | Paper |
| Is information-theoretic topology-hiding computation possible? | 2020-04-30 | Paper |
| Non-malleable codes against bounded polynomial time tampering | 2020-02-04 | Paper |
| Proofs of Work from worst-case assumptions | 2018-09-12 | Paper |
| Exploring the boundaries of topology-hiding computation | 2018-07-17 | Paper |
| Non-malleable codes from average-case hardness: \({\mathsf{A}}{\mathsf{C}}^0\), decision trees, and streaming space-bounded tampering | 2018-07-17 | Paper |
Average-case fine-grained hardness
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Non-malleable codes for bounded depth, bounded fan-in circuits
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
