| Publication | Date of Publication | Type |
|---|
| Collision Resistance from Multi-collision Resistance | 2024-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126256 | 2024-04-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6126305 | 2024-04-09 | Paper |
| Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge) | 2023-11-14 | Paper |
| PPAD is as hard as LWE and iterated squaring | 2023-08-14 | Paper |
| Collision-resistance from multi-collision-resistance | 2023-06-30 | Paper |
| Faster sounder succinct arguments and \textsf{IOP}s | 2023-06-12 | Paper |
| Succinct interactive oracle proofs: applications and limitations | 2023-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5875702 | 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 | 2022-03-31 | Paper |
| Batch verification and proofs of proximity with polylog overhead | 2022-03-23 | 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 |
| Public-coin statistical zero-knowledge batch verification against malicious verifiers | 2021-12-08 | Paper |
| Constant-Round Interactive Proofs for Delegating Computation | 2021-06-29 | Paper |
| Zero-Knowledge Proofs of Proximity | 2021-06-15 | Paper |
| Relaxed Locally Correctable Codes | 2021-06-15 | Paper |
| Toward non-interactive zero-knowledge proofs for NP from LWE | 2021-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5857610 | 2021-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121910 | 2020-09-22 | Paper |
| From laconic zero-knowledge to public-key cryptography. Extended abstract | 2020-06-30 | Paper |
| Statistical difference beyond the polarizing regime | 2020-04-30 | Paper |
| On the (In)security of Kilian-based SNARGs | 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 | 2020-01-30 | Paper |
| Towards non-interactive zero-knowledge for NP from LWE | 2020-01-28 | Paper |
| Fiat-Shamir and correlation intractability from strong KDM-secure encryption | 2018-07-09 | Paper |
| Multi-collision resistant hash functions and their applications | 2018-07-09 | Paper |
| Proofs of proximity for context-free languages and read-once branching programs | 2018-06-14 | Paper |
| A Hierarchy Theorem for Interactive Proofs of Proximity | 2018-05-03 | Paper |
| Non-interactive proofs of proximity | 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 | 2017-09-29 | Paper |
| Non-Interactive Proofs of Proximity | 2017-05-19 | Paper |
| Spooky Encryption and Its Applications | 2016-11-09 | Paper |
| Arguments of Proximity | 2015-12-10 | Paper |
| Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs | 2015-10-27 | Paper |
| How to delegate computations | 2015-06-26 | Paper |
| Delegation for bounded space | 2014-08-07 | Paper |
| Fast Pseudorandomness for Independence and Load Balancing | 2014-07-01 | Paper |
| Pseudorandom Graphs in Data Structures | 2014-07-01 | Paper |
| Efficient Multiparty Protocols via Log-Depth Threshold Formulae | 2013-09-17 | Paper |
| Enhancements of trapdoor permutations | 2013-08-01 | Paper |
| On the Circular Security of Bit-Encryption | 2013-03-18 | Paper |
| Homomorphic Encryption: From Private-Key to Public-Key | 2011-05-19 | Paper |
