| Publication | Date of Publication | Type |
|---|
| Lifting standard model reductions to common setup assumptions | 2023-08-10 | Paper |
| Cryptographic role-based access control, reconsidered | 2023-07-21 | Paper |
| Generic forward-secure key agreement without signatures | 2022-11-02 | Paper |
| Adaptive Proofs Have Straightline Extractors (in the Random Oracle Model) | 2022-07-01 | Paper |
| Provable security analysis of FIDO2 | 2022-04-22 | Paper |
| Masking fuzzy-searchable public databases | 2020-01-30 | Paper |
| Efficient function-hiding functional encryption: from inner-products to orthogonality | 2020-01-28 | Paper |
| How to build time-lock encryption | 2018-10-10 | Paper |
| Multi-key authenticated encryption with corruptions: reductions are lossy | 2018-01-19 | Paper |
| A linear space algorithm for computing the hermite normal form | 2017-02-03 | Paper |
| Universally Composable Cryptographic Role-Based Access Control | 2017-01-06 | Paper |
| A Modular Treatment of Cryptographic APIs: The Symmetric-Key Case | 2016-11-30 | Paper |
| Provably-Secure Remote Memory Attestation for Heap Overflow Protection | 2016-10-21 | Paper |
| Selective Opening Security for Receivers | 2016-06-10 | Paper |
| On the Hardness of Proving CCA-Security of Signed ElGamal | 2016-04-13 | Paper |
| Adaptive Proofs of Knowledge in the Random Oracle Model | 2015-08-27 | Paper |
| Cryptographic Voting — A Gentle Introduction | 2015-05-27 | Paper |
| Homomorphic Signatures with Efficient Verification for Polynomial Functions | 2014-08-07 | Paper |
| Cryptographic puzzles and DoS resilience, revisited | 2014-08-01 | Paper |
| Explicit randomness is not necessary when modeling probabilistic encryption | 2013-12-13 | Paper |
| How Not to Prove Yourself: Pitfalls of the Fiat-Shamir Heuristic and Applications to Helios | 2013-03-19 | Paper |
| Efficient Network Coding Signatures in the Standard Model | 2012-07-20 | Paper |
| Secure proxy signature schemes for delegation of signing rights | 2012-05-23 | Paper |
| A survey of symbolic methods in computational analysis of cryptographic systems | 2011-06-03 | Paper |
| Adaptive Pseudo-free Groups and Applications | 2011-05-27 | Paper |
| Get Shorty via Group Signatures without Encryption | 2010-09-10 | Paper |
| The Fiat–Shamir Transform for Group and Ring Signature Schemes | 2010-09-10 | Paper |
| Groth–Sahai Proofs Revisited | 2010-05-28 | Paper |
| The TLS handshake protocol: A modular analysis | 2010-03-01 | Paper |
| Practical Zero-Knowledge Proofs for Circuit Evaluation | 2010-01-07 | Paper |
| Foundations of Non-malleable Hash and One-Way Functions | 2009-12-15 | Paper |
| Security Notions and Generic Constructions for Client Puzzles | 2009-12-15 | Paper |
| Separating Trace Mapping and Reactive Simulatability Soundness: The Case of Adaptive Corruption | 2009-10-22 | Paper |
| Identity Based Group Signatures from Hierarchical Identity-Based Encryption | 2009-08-18 | Paper |
| Certified Encryption Revisited | 2009-07-07 | Paper |
| Hash function requirements for Schnorr signatures | 2009-06-12 | Paper |
| Theory of Cryptography | 2009-05-14 | Paper |
| A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness | 2009-03-10 | Paper |
| A Modular Security Analysis of the TLS Handshake Protocol | 2009-02-10 | Paper |
| Security analysis of cryptographically controlled access to XML documents | 2008-12-21 | Paper |
| Computationally Sound Symbolic Secrecy in the Presence of Hash Functions | 2008-04-17 | Paper |
| A Closer Look at PKI: Security and Efficiency | 2007-09-04 | Paper |
| Foundations of Software Science and Computation Structures | 2007-05-02 | Paper |
| Security in Communication Networks | 2006-10-10 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Programming Languages and Systems | 2005-09-13 | Paper |
| Information and Communications Security | 2005-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4434902 | 2003-11-26 | Paper |
