| Publication | Date of Publication | Type |
|---|
Locally covert learning
| 2024-11-22 | Paper |
Delegation for search problems
| 2024-06-24 | Paper |
Parallel repetition for all 3-player games over binary alphabet
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Parallel Repetition for the GHZ Game: A Simpler Proof.
| 2023-11-20 | Paper |
Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge)
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
PPAD is as hard as LWE and iterated squaring
Theory of Cryptography | 2023-08-14 | Paper |
Nearly optimal property preserving hashing
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
Faster sounder succinct arguments and \textsf{IOP}s
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
scientific article; zbMATH DE number 7650434 (Why is no real title available?)
| 2023-02-03 | Paper |
Time- and space-efficient arguments from groups of unknown order
| 2022-05-18 | Paper |
Public-coin zero-knowledge arguments with (almost) minimal time and space overheads
| 2022-03-23 | Paper |
Transparent error correcting in a computationally bounded world
| 2022-03-23 | Paper |
On the plausibility of fully homomorphic encryption for RAMs
| 2020-05-20 | Paper |
Permuted puzzles and cryptographic hardness
| 2020-04-30 | Paper |
On the (In)security of Kilian-based SNARGs
| 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 |
The parallel repetition of non-signaling games: counterexamples and dichotomy
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Watermarking cryptographic capabilities
SIAM Journal on Computing | 2018-12-05 | Paper |
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
SIAM Journal on Computing | 2018-07-04 | Paper |
Towards doubly efficient private information retrieval
| 2018-01-19 | Paper |
Watermarking cryptographic capabilities
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Non-interactive delegation and batch NP verification from standard computational assumptions
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Adaptive succinct garbled RAM or: how to delegate your database
Theory of Cryptography | 2016-12-22 | Paper |
Fully succinct garbled RAM
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Multilinear pseudorandom functions
Automata, Languages, and Programming | 2015-10-27 | Paper |
Succinct garbling and indistinguishability obfuscation for RAM programs
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
