| Publication | Date of Publication | Type |
|---|
| Efficient interactive proofs for non-deterministic bounded space | 2025-01-14 | Paper |
| Strong batching for non-interactive statistical zero-knowledge | 2024-11-13 | Paper |
| Combinatorially homomorphic encryption | 2024-08-02 | Paper |
| Delegation for search problems | 2024-06-24 | Paper |
Collision Resistance from Multi-collision Resistance
Journal of Cryptology | 2024-04-21 | Paper |
| scientific article; zbMATH DE number 7829262 (Why is no real title available?) | 2024-04-09 | Paper |
| scientific article; zbMATH DE number 7829299 (Why is no real title available?) | 2024-04-09 | 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 |
Collision-resistance from multi-collision-resistance
Advances in Cryptology – CRYPTO 2022 | 2023-06-30 | Paper |
Succinct interactive oracle proofs: applications and limitations
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
Faster sounder succinct arguments and \textsf{IOP}s
Advances in Cryptology – CRYPTO 2022 | 2023-06-12 | Paper |
scientific article; zbMATH DE number 7650357 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-03 | Paper |
| Time- and space-efficient arguments from groups of unknown order | 2022-05-18 | Paper |
How to Delegate Computations: The Power of No-Signaling Proofs
Journal of the ACM | 2022-03-31 | Paper |
| Batch verification for statistical zero knowledge proofs | 2022-03-23 | Paper |
| Public-coin zero-knowledge arguments with (almost) minimal time and space overheads | 2022-03-23 | Paper |
| Batch verification and proofs of proximity with polylog overhead | 2022-03-23 | Paper |
| Public-coin statistical zero-knowledge batch verification against malicious verifiers | 2021-12-08 | Paper |
Constant-round interactive proofs for delegating computation
SIAM Journal on Computing | 2021-06-29 | Paper |
| Relaxed locally correctable codes | 2021-06-15 | Paper |
| Zero-knowledge proofs of proximity | 2021-06-15 | Paper |
Toward non-interactive zero-knowledge proofs for NP from LWE
Journal of Cryptology | 2021-04-07 | Paper |
Relaxed locally correctable codes
Theory of Computing | 2021-04-01 | Paper |
| scientific article; zbMATH DE number 7250162 (Why is no real title available?) | 2020-09-22 | Paper |
| From laconic zero-knowledge to public-key cryptography. Extended abstract | 2020-06-30 | Paper |
| On the (In)security of Kilian-based SNARGs | 2020-04-30 | Paper |
| Statistical difference beyond the polarizing regime | 2020-04-30 | Paper |
| New constructions of reusable designated-verifier NIZKs | 2020-03-09 | Paper |
| Reusable designated-verifier NIZKs for all NP from CDH | 2020-02-06 | Paper |
Fiat-Shamir: from practice to theory
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Towards non-interactive zero-knowledge for NP from LWE | 2020-01-28 | Paper |
| Multi-collision resistant hash functions and their applications | 2018-07-09 | Paper |
| Fiat-Shamir and correlation intractability from strong KDM-secure encryption | 2018-07-09 | Paper |
Proofs of proximity for context-free languages and read-once branching programs
Information and Computation | 2018-06-14 | Paper |
| A hierarchy theorem for interactive proofs of proximity | 2018-05-03 | Paper |
Non-interactive proofs of proximity
Computational Complexity | 2018-04-18 | Paper |
| Distinguisher-dependent simulation in two rounds and its applications | 2017-11-15 | Paper |
| From obfuscation to the security of Fiat-Shamir for proofs | 2017-11-15 | Paper |
Constant-round interactive proofs for delegating computation
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Non-interactive proofs of proximity
Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science | 2017-05-19 | Paper |
Spooky Encryption and Its Applications
Advances in Cryptology – CRYPTO 2016 | 2016-11-09 | Paper |
Arguments of proximity (extended abstract)
Lecture Notes in Computer Science | 2015-12-10 | Paper |
Proofs of proximity for context-free languages and read-once branching programs
Automata, Languages, and Programming | 2015-10-27 | Paper |
How to delegate computations
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
Delegation for bounded space
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Pseudorandom Graphs in Data Structures
Automata, Languages, and Programming | 2014-07-01 | Paper |
Fast pseudorandomness for independence and load balancing (extended abstract)
Automata, Languages, and Programming | 2014-07-01 | Paper |
Efficient multiparty protocols via log-depth threshold formulae. (Extended abstract)
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Enhancements of trapdoor permutations
Journal of Cryptology | 2013-08-01 | Paper |
On the circular security of bit-encryption
Theory of Cryptography | 2013-03-18 | Paper |
Homomorphic encryption: from private-key to public-key
Theory of Cryptography | 2011-05-19 | Paper |
