| Publication | Date of Publication | Type |
|---|
| Reusable online-efficient commitments | 2024-12-13 | Paper |
| Robust additive randomized encodings from IO and pseudo-non-linear codes | 2024-12-13 | Paper |
| Amplification of non-interactive zero knowledge, revisited | 2024-12-13 | Paper |
| Bootstrapping homomorphic encryption via functional encryption | 2024-09-25 | Paper |
| Non-interactive universal arguments | 2024-02-02 | Paper |
| PPAD is as hard as LWE and iterated squaring | 2023-08-14 | Paper |
| Statistically sender-private OT from LPN and derandomization | 2023-06-30 | Paper |
| Constructive post-quantum reductions | 2023-06-30 | Paper |
| Post-quantum resettably-sound zero knowledge | 2023-03-31 | Paper |
| Classical binding for quantum commitments | 2023-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875699 | 2023-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875726 | 2023-02-03 | Paper |
| Non-malleable commitments against quantum attacks | 2022-08-30 | Paper |
| A note on perfect correctness by derandomization | 2022-06-16 | 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 |
| Characterizing deterministic-prover zero knowledge | 2021-12-01 | Paper |
| Weakly extractable one-way functions | 2021-12-01 | Paper |
| Structure versus hardness through the obfuscation lens | 2021-02-08 | Paper |
| Post-quantum zero knowledge in constant rounds | 2021-01-19 | Paper |
| On the complexity of collision resistant hash functions: new and old black-box separations | 2020-04-30 | Paper |
| From cryptomania to obfustopia through secret-key functional encryption | 2020-04-28 | Paper |
| Verifiable random functions from non-interactive witness-indistinguishable proofs | 2020-04-28 | Paper |
| On round optimal statistical zero knowledge arguments | 2020-03-09 | Paper |
| Distributional collision resistance beyond one-way functions | 2020-02-04 | 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 |
| Indistinguishability obfuscation from functional encryption | 2019-02-25 | Paper |
| One-message zero knowledge and non-malleable commitments | 2018-12-11 | Paper |
| Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings | 2018-07-04 | Paper |
| The hunting of the SNARK | 2018-02-15 | Paper |
| Verifiable random functions from non-interactive witness-indistinguishable proofs | 2018-01-19 | Paper |
| On virtual grey box obfuscation for general circuits | 2018-01-05 | Paper |
| Structure vs. hardness through the obfuscation lens | 2017-11-03 | Paper |
| On Removing Graded Encodings from Functional Encryption | 2017-06-13 | Paper |
| A note on perfect correctness by derandomization | 2017-06-13 | Paper |
| From cryptomania to obfustopia through secret-key functional encryption | 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 |
| From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again | 2016-10-07 | Paper |
| Time-lock puzzles from randomized encodings | 2016-04-15 | Paper |
| Indistinguishability obfuscation: from approximate to exact | 2016-03-23 | Paper |
| Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation | 2016-03-23 | Paper |
| On non-black-box simulation and the impossibility of approximate obfuscation | 2015-11-04 | Paper |
| Succinct randomized encodings and their applications | 2015-08-21 | 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 strong simulation and composable point obfuscation | 2014-09-25 | 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 |
| Recursive composition and bootstrapping for SNARKs and proof-carrying data | 2014-08-07 | Paper |
| Leakage-tolerant computation with input-independent preprocessing | 2014-08-07 | Paper |
| Obfuscation for evasive functions | 2014-02-18 | Paper |
| Succinct non-interactive arguments via linear interactive proofs | 2013-03-18 | Paper |
| Why ``Fiat-Shamir for proofs lacks a proof | 2013-03-18 | Paper |
| Succinct arguments from multi-prover interactive proofs and their efficiency benefits | 2012-09-25 | Paper |
| Leakage-Tolerant Interactive Protocols | 2012-06-15 | Paper |
| Point obfuscation and 3-round zero-knowledge | 2012-06-15 | Paper |
| Program obfuscation with leaky hardware | 2011-12-02 | Paper |
| On strong simulation and composable point obfuscation | 2010-08-24 | Paper |
