| Publication | Date of Publication | Type |
|---|
| Quantum Hoare logic with ghost variables | 2024-12-19 | Paper |
| Towards compressed permutation oracles | 2024-09-13 | Paper |
| How to base security on the perfect/statistical binding property of quantum bit commitment? | 2024-09-11 | Paper |
| A thorough treatment of highly-efficient NTRU instantiations | 2023-11-24 | Paper |
| Relationships between quantum IND-CPA notions | 2023-03-31 | Paper |
| Post-quantum verification of Fujisaki-Okamoto | 2023-03-21 | Paper |
| Everlasting UC commitments from fully malicious PUFs | 2022-07-15 | Paper |
| Generic authenticated key exchange in the quantum random oracle model | 2021-12-01 | Paper |
| Quantum security proofs using semi-classical oracles | 2020-03-09 | Paper |
| Everlasting multi-party computation | 2018-11-01 | Paper |
| On the (im-)possibility of extending coin toss | 2018-11-01 | Paper |
| Revocable Quantum Timed-Release Encryption | 2018-08-02 | Paper |
| Post-quantum security of the sponge construction | 2018-06-22 | Paper |
| Post-quantum security of Fiat-Shamir | 2018-04-06 | Paper |
| Security of blind signatures revisited | 2017-05-22 | Paper |
| Collapse-Binding Quantum Commitments Without Random Oracles | 2017-01-06 | Paper |
| Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms | 2016-12-22 | Paper |
| Computationally Binding Quantum Commitments | 2016-07-15 | Paper |
| Quantum Collision-Resistance of Non-uniformly Distributed Functions | 2016-04-26 | Paper |
| Post-Quantum Security of the CBC, CFB, OFB, CTR, and XTS Modes of Operation | 2016-04-26 | Paper |
| Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model | 2015-09-30 | Paper |
| Quantum Position Verification in the Random Oracle Model | 2014-08-07 | Paper |
| Revocable Quantum Timed-Release Encryption | 2014-05-27 | Paper |
| On using probabilistic Turing machines to model participants in cryptographic protocols | 2014-01-10 | Paper |
| Quantum programs with classical output streams (extended abstract) | 2013-12-06 | Paper |
| Everlasting Multi-party Computation | 2013-09-17 | Paper |
| Computational Soundness of Symbolic Zero-Knowledge Proofs: Weaker Assumptions and Mechanized Verification | 2013-08-06 | Paper |
| Polynomial runtime and composability | 2013-08-01 | Paper |
| Security of blind signatures revisited | 2012-07-20 | Paper |
| Quantum proofs of knowledge | 2012-06-29 | Paper |
| Round optimal blind signatures | 2011-08-12 | Paper |
| Concurrent composition in the bounded quantum storage model | 2011-05-27 | Paper |
| Long-term security and universal composability | 2010-11-12 | Paper |
| Universally composable incoercibility | 2010-08-24 | Paper |
| Universally composable quantum multi-party computation | 2010-06-01 | Paper |
| Random Oracles and Auxiliary Input | 2009-03-10 | Paper |
| OAEP Is Secure under Key-Dependent Messages | 2009-02-10 | Paper |
| Limits of Constructive Security Proofs | 2009-02-10 | Paper |
| A Formal Language for Cryptographic Pseudocode | 2009-01-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3545325 | 2008-12-10 | Paper |
| Towards Key-Dependent Message Security in the Standard Model | 2008-04-15 | Paper |
| Universally composable zero-knowledge arguments and commitments from signature cards | 2008-03-05 | Paper |
| On the (Im-)Possibility of Extending Coin Toss | 2007-09-24 | Paper |
| Long-Term Security and Universal Composability | 2007-08-30 | Paper |
| On the Necessity of Rewinding in Secure Multiparty Computation | 2007-08-30 | Paper |
| Information Security | 2006-10-20 | Paper |
| Theory of Cryptography | 2005-12-07 | Paper |
