| Publication | Date of Publication | Type |
|---|
| Incrementally verifiable computation via rate-1 batch arguments | 2025-08-15 | Paper |
| On the cryptographic hardness of finding a Nash equilibrium | 2025-08-05 | Paper |
| From the impossibility of obfuscation to a new non-black-box simulation technique | 2025-05-05 | Paper |
| Reusable online-efficient commitments | 2024-12-13 | Paper |
| Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance | 2024-11-13 | Paper |
| Monotone-policy aggregate signatures | 2024-11-13 | Paper |
Non-interactive universal arguments
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
SNARGs for monotone policy batch NP
Advances in Cryptology – CRYPTO 2023 | 2024-02-02 | Paper |
Verifiable private information retrieval
Theory of Cryptography | 2023-08-14 | Paper |
PPAD is as hard as LWE and iterated squaring
Theory of Cryptography | 2023-08-14 | Paper |
| Delegation with updatable unambiguous proofs and PPAD-hardness | 2022-12-07 | Paper |
Succinct non-interactive arguments via linear interactive proofs
Journal of Cryptology | 2022-05-10 | Paper |
Weak Zero-Knowledge beyond the Black-Box Barrier
SIAM Journal on Computing | 2022-02-08 | Paper |
| Weakly extractable one-way functions | 2021-12-01 | Paper |
| Incrementally verifiable computation via incremental PCPs | 2020-04-30 | Paper |
| On round optimal statistical zero knowledge arguments | 2020-03-09 | Paper |
How to delegate computations publicly
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Weak zero-knowledge beyond the black-box barrier
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Multi-collision resistance: a paradigm for keyless hash functions
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
| On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments | 2018-01-19 | Paper |
On virtual grey box obfuscation for general circuits
Algorithmica | 2018-01-05 | Paper |
On Removing Graded Encodings from Functional Encryption
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Delegating RAM Computations
Theory of Cryptography | 2016-12-22 | Paper |
3-message zero knowledge against human ignorance
Theory of Cryptography | 2016-12-21 | Paper |
On the existence of extractable one-way functions
SIAM Journal on Computing | 2016-10-28 | Paper |
Reusable fuzzy extractors for low-entropy distributions
Advances in Cryptology – EUROCRYPT 2016 | 2016-09-09 | Paper |
Time-lock puzzles from randomized encodings
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science | 2016-04-15 | Paper |
Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
Theory of Cryptography | 2016-03-23 | Paper |
On non-black-box simulation and the impossibility of approximate obfuscation
SIAM Journal on Computing | 2015-11-04 | Paper |
On obfuscation with random oracles
Theory of Cryptography | 2015-07-06 | Paper |
ZAPs and non-interactive witness indistinguishability from indistinguishability obfuscation
Theory of Cryptography | 2015-07-06 | Paper |
On the existence of extractable one-way functions
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
On virtual grey box obfuscation for general circuits
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
On the impossibility of approximate obfuscation and applications to resettable cryptography
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
The impossibility of obfuscation with auxiliary input or a universal simulator
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Client-server concurrent zero knowledge with constant rounds and guaranteed complexity
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Protecting obfuscation against algebraic attacks
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Verifiable set operations over outsourced databases
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Obfuscation for evasive functions
Theory of Cryptography | 2014-02-18 | Paper |
On the achievability of simulation-based security for functional encryption
Advances in Cryptology – CRYPTO 2013 | 2013-09-17 | Paper |
Succinct non-interactive arguments via linear interactive proofs
Theory of Cryptography | 2013-03-18 | Paper |
Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
Theory of Cryptography | 2013-03-18 | Paper |
Point obfuscation and 3-round zero-knowledge
Theory of Cryptography | 2012-06-15 | Paper |
