| Publication | Date of Publication | Type |
|---|
| Compact proofs of partial knowledge for overlapping CNF formulae | 2024-12-27 | Paper |
| Black-box (and fast) non-malleable zero knowledge | 2024-12-13 | Paper |
| Zero‐Knowledge Proofs | 2023-08-04 | Paper |
| Efficient proofs of knowledge for threshold relations | 2023-07-28 | Paper |
| Efficient NIZK arguments with straight-line simulation and extraction | 2023-07-28 | Paper |
| Doubly adaptive zero-knowledge proofs | 2023-07-21 | Paper |
| Black-box constructions of bounded-concurrent secure computation | 2022-12-16 | Paper |
| Shielded computations in smart contracts overcoming forks | 2022-06-17 | Paper |
| Publicly verifiable zero knowledge from (collapsing) blockchains | 2021-12-21 | Paper |
| How to extract useful randomness from unreliable sources | 2021-12-01 | Paper |
| Continuously non-malleable codes in the split-state model from minimal assumptions | 2020-06-30 | Paper |
| UC-secure multiparty computation from one-way functions using stateless tokens | 2020-05-05 | Paper |
| Universally composable secure computation with corrupted tokens | 2020-03-09 | Paper |
| Publicly verifiable proofs from blockchains | 2020-01-28 | Paper |
| Non-interactive zero knowledge \textit{proofs} in the random oracle model | 2019-10-14 | Paper |
| Non-interactive secure computation from one-way functions | 2019-01-23 | Paper |
| Round-optimal secure two-party computation from trapdoor permutations | 2018-01-19 | Paper |
| Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds | 2018-01-19 | Paper |
| Resettably-sound resettable zero knowledge in constant rounds | 2018-01-19 | Paper |
| Four-round concurrent non-malleable commitments from one-way functions | 2017-11-15 | Paper |
| Delayed-input cryptographic protocols | 2017-08-04 | Paper |
| Unconditional UC-Secure Computation with (Stronger-Malicious) PUFs | 2017-06-13 | Paper |
| Concurrent Non-Malleable Commitments (and More) in 3 Rounds | 2016-11-09 | Paper |
| Online/Offline OR Composition of Sigma Protocols | 2016-07-15 | Paper |
| A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles | 2016-04-08 | Paper |
| Improved OR-Composition of Sigma-Protocols | 2016-04-08 | Paper |
| Impossibility of Black-Box Simulation Against Leakage Attacks | 2015-12-10 | Paper |
| Executable Proofs, Input-Size Hiding Secure Computation and a New Ideal World | 2015-09-30 | Paper |
| Black-box non-black-box zero knowledge | 2015-06-26 | Paper |
| On Selective-Opening Attacks against Encryption Schemes | 2014-10-14 | Paper |
| On Input Indistinguishable Proof Systems | 2014-07-01 | Paper |
| 4-Round Resettably-Sound Zero Knowledge | 2014-02-18 | Paper |
| Statistical Concurrent Non-malleable Zero Knowledge | 2014-02-18 | Paper |
| Constant-Round Concurrent Zero Knowledge in the Bounded Player Model | 2013-12-10 | Paper |
| Nearly Simultaneously Resettable Black-Box Zero Knowledge | 2013-08-12 | Paper |
| Universally Composable Secure Computation with (Malicious) Physically Uncloneable Functions | 2013-05-31 | Paper |
| On constant-round concurrent non-malleable proof systems | 2013-04-04 | Paper |
| Concurrent Zero Knowledge in the Bounded Player Model | 2013-03-18 | Paper |
| Revisiting Lower and Upper Bounds for Selective Decommitments | 2013-03-18 | Paper |
| Secure Database Commitments and Universal Arguments of Quasi Knowledge | 2012-09-25 | Paper |
| Impossibility Results for Static Input Secure Computation | 2012-09-25 | Paper |
| On Round-Optimal Zero Knowledge in the Bare Public-Key Model | 2012-06-29 | Paper |
| Simultaneously Resettable Arguments of Knowledge | 2012-06-15 | Paper |
| Resettable Statistical Zero Knowledge | 2012-06-15 | Paper |
| Secure Set Intersection with Untrusted Hardware Tokens | 2011-02-11 | Paper |
| Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments | 2010-05-28 | Paper |
| Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge | 2010-02-24 | Paper |
| Theoretical Computer Science | 2010-02-23 | Paper |
| Collusion-Free Multiparty Computation in the Mediated Model | 2009-10-20 | Paper |
| Co-sound Zero-Knowledge with Public Keys | 2009-07-07 | Paper |
| Hybrid commitments and their applications to zero-knowledge proof systems | 2009-06-22 | Paper |
| Simulation-Based Concurrent Non-malleable Commitments and Decommitments | 2009-03-03 | Paper |
| Collusion-Free Protocols in the Mediated Model | 2009-02-10 | Paper |
| Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model | 2008-08-19 | Paper |
| Impossibility and Feasibility Results for Zero Knowledge with Public Keys | 2008-03-17 | Paper |
| Completely Non-malleable Encryption Revisited | 2008-03-05 | Paper |
| Efficient Zero Knowledge on the Internet | 2007-09-11 | Paper |
| On Non-Interactive Zero-Knowledge Proofs of Knowledge in the Shared Random String Model | 2007-09-05 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| Improved Setup Assumptions for 3-Round Resettable Zero Knowledge | 2005-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450730 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414283 | 2003-07-24 | Paper |
