| Publication | Date of Publication | Type |
|---|
| Universal Equivalence and Majority of Probabilistic Programs over Finite Fields | 2022-12-08 | Paper |
| When are three voters enough for privacy properties? | 2022-08-19 | Paper |
| The Hitchhiker's guide to decidability and complexity of equivalence properties in security protocols | 2021-07-08 | Paper |
| Universal equivalence and majority of probabilistic programs over finite fields | 2021-01-21 | Paper |
| Beyond Subterm-Convergent Equational Theories in Automated Verification of Stateful Protocols | 2020-08-03 | Paper |
| On Communication Models When Verifying Equivalence Properties | 2020-08-03 | Paper |
| Automated Verification of Equivalence Properties of Cryptographic Protocols | 2017-07-13 | Paper |
| Composition of password-based protocols | 2014-06-30 | Paper |
| Dynamic Tags for Security Protocols | 2014-06-23 | Paper |
| Practical Everlasting Privacy | 2013-08-06 | Paper |
| Simulation based security in the applied pi calculus | 2012-10-24 | Paper |
| Security Protocols, Constraint Systems, and Group Theories | 2012-09-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2911625 | 2012-08-31 | Paper |
| Reducing equational theories for the decision of static equivalence | 2012-07-17 | Paper |
| Computing knowledge in security protocols under convergent equational theories | 2012-07-17 | Paper |
| Automated Verification of Equivalence Properties of Cryptographic Protocols | 2012-06-22 | Paper |
| A survey of symbolic methods in computational analysis of cryptographic systems | 2011-06-03 | Paper |
| Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster | 2010-06-17 | Paper |
| Reducing Equational Theories for the Decision of Static Equivalence | 2010-01-14 | Paper |
| Computing Knowledge in Security Protocols under Convergent Equational Theories | 2009-07-28 | Paper |
| Computationally sound implementations of equational theories against passive adversaries | 2009-04-16 | Paper |
| From One Session to Many: Dynamic Tags for Security Protocols | 2009-01-27 | Paper |
| Proving Group Protocols Secure Against Eavesdroppers | 2008-11-27 | Paper |
| Symbolic Bisimulation for the Applied Pi Calculus | 2008-04-24 | Paper |
| Computationally Sound Symbolic Secrecy in the Presence of Hash Functions | 2008-04-17 | Paper |
| Juggling with pattern matching | 2007-02-13 | Paper |
| Formal analysis of multiparty contract signing | 2007-01-30 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Information Security and Cryptology - ICISC 2003 | 2005-12-27 | Paper |
| Financial Cryptography and Data Security | 2005-12-22 | Paper |
| Programming Languages and Systems | 2005-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448415 | 2004-02-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413343 | 2003-07-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4791273 | 2003-02-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788571 | 2003-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2762894 | 2002-01-13 | Paper |
