| Publication | Date of Publication | Type |
|---|
| 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 | 2024-02-02 | Paper |
| SNARGs for monotone policy batch NP | 2024-02-02 | Paper |
| Verifiable private information retrieval | 2023-08-14 | Paper |
| PPAD is as hard as LWE and iterated squaring | 2023-08-14 | Paper |
| Delegation with updatable unambiguous proofs and PPAD-hardness | 2022-12-07 | Paper |
| Succinct non-interactive arguments via linear interactive proofs | 2022-05-10 | Paper |
| Weak Zero-Knowledge beyond the Black-Box Barrier | 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 | 2020-01-30 | Paper |
| Weak zero-knowledge beyond the black-box barrier | 2020-01-30 | Paper |
| Multi-collision resistance: a paradigm for keyless hash functions | 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 | 2018-01-05 | Paper |
| On Removing Graded Encodings from Functional Encryption | 2017-06-13 | Paper |
| Delegating RAM Computations | 2016-12-22 | Paper |
| 3-Message Zero Knowledge Against Human Ignorance | 2016-12-21 | Paper |
| On the existence of extractable one-way functions | 2016-10-28 | Paper |
| Reusable Fuzzy Extractors for Low-Entropy Distributions | 2016-09-09 | Paper |
| Time-lock puzzles from randomized encodings | 2016-04-15 | Paper |
| Perfect Structure on the Edge of Chaos | 2016-03-23 | Paper |
| On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation | 2015-11-04 | Paper |
| On Obfuscation with Random Oracles | 2015-07-06 | Paper |
| ZAPs and Non-Interactive Witness Indistinguishability from Indistinguishability Obfuscation | 2015-07-06 | Paper |
| On the existence of extractable one-way functions | 2015-06-26 | Paper |
| On Virtual Grey Box Obfuscation for General Circuits | 2014-08-07 | Paper |
| On the impossibility of approximate obfuscation and applications to resettable cryptography | 2014-08-07 | Paper |
| The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator | 2014-08-07 | Paper |
| Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity | 2014-08-07 | Paper |
| Protecting Obfuscation against Algebraic Attacks | 2014-05-27 | Paper |
| Verifiable Set Operations over Outsourced Databases | 2014-03-25 | Paper |
| Obfuscation for Evasive Functions | 2014-02-18 | Paper |
| On the Achievability of Simulation-Based Security for Functional Encryption | 2013-09-17 | Paper |
| Succinct Non-interactive Arguments via Linear Interactive Proofs | 2013-03-18 | Paper |
| Public-Coin Concurrent Zero-Knowledge in the Global Hash Model | 2013-03-18 | Paper |
| Point Obfuscation and 3-Round Zero-Knowledge | 2012-06-15 | Paper |
