| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q5874186 | 2023-02-07 | Paper |
| Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols | 2022-12-22 | Paper |
| Efficiently deciding equivalence for standard primitives and phases | 2022-08-25 | Paper |
| Checking trace equivalence: how to get rid of nonces? | 2022-08-19 | Paper |
| When are three voters enough for privacy properties? | 2022-08-19 | Paper |
| A decidable class of security protocols for both reachability and equivalence properties | 2021-06-09 | Paper |
| Belenios: a simple private and verifiable electronic voting system | 2020-03-03 | Paper |
| Typing messages for free in security protocols | 2019-11-22 | Paper |
| Equivalence properties by typing in cryptographic branching protocols | 2019-09-16 | Paper |
| Secure refinements of communication channels | 2017-07-13 | Paper |
| From security protocols to pushdown automata | 2017-07-12 | Paper |
| YAPA: a generic tool for computing intruder knowledge | 2015-09-17 | Paper |
| Deciding security properties for cryptographic protocols. application to key cycles | 2015-09-17 | Paper |
| Modeling and verifying ad hoc routing protocols | 2014-10-20 | Paper |
| A generic security API for symmetric key management on cryptographic devices | 2014-10-20 | Paper |
| Electronic Voting: How Logic Can Help | 2014-09-26 | Paper |
| Typing messages for free in security protocols: the case of equivalence properties | 2014-09-15 | Paper |
| Deciding equivalence-based properties using constraint solving | 2014-01-10 | Paper |
| Explicit randomness is not necessary when modeling probabilistic encryption | 2013-12-13 | Paper |
| From security protocols to pushdown automata | 2013-08-07 | Paper |
| Practical Everlasting Privacy | 2013-08-06 | Paper |
| Tractable inference systems: an extension with a deducibility predicate | 2013-06-14 | Paper |
| Relating two standard notions of secrecy | 2012-09-28 | Paper |
| Secure composition of protocols | 2012-08-22 | Paper |
| Decidability and combination results for two notions of knowledge in security protocols | 2012-07-17 | Paper |
| Analysing routing protocols: four nodes topologies are sufficient | 2012-06-29 | Paper |
| Security proof with dishonest keys | 2012-06-29 | Paper |
| How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. | 2012-01-23 | Paper |
| Deciding knowledge in security protocols under some e-voting theories | 2011-10-28 | Paper |
| Deciding security for protocols with recursive tests | 2011-07-29 | Paper |
| A survey of symbolic methods in computational analysis of cryptographic systems | 2011-06-03 | Paper |
| Safely composing security protocols | 2009-07-06 | Paper |
| YAPA: A Generic Tool for Computing Intruder Knowledge | 2009-06-30 | Paper |
| Computationally sound implementations of equational theories against passive adversaries | 2009-04-16 | Paper |
| Relating Two Standard Notions of Secrecy | 2009-03-12 | Paper |
| Combining Algorithms for Deciding Knowledge in Security Protocols | 2008-09-16 | Paper |
| Deciding Key Cycles for Security Protocols | 2008-05-27 | Paper |
| Deciding Knowledge in Security Protocols for Monoidal Equational Theories | 2008-05-15 | Paper |
| Safely Composing Security Protocols | 2008-04-24 | Paper |
| Computationally Sound Symbolic Secrecy in the Presence of Hash Functions | 2008-04-17 | Paper |
| Relating two standard notions of secrecy | 2007-11-15 | Paper |
| Automatic Analysis of the Security of XOR-Based Key Management Schemes | 2007-09-03 | Paper |
| Deciding knowledge in security protocols under equational theories | 2007-01-09 | Paper |
| A note on maximally repeated sub-patterns of a point set | 2006-09-14 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Programming Languages and Systems | 2005-09-13 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Tree automata with one memory set constraints and cryptographic protocols | 2005-04-06 | Paper |
| Security properties: two agents are sufficient | 2004-11-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447230 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417886 | 2003-07-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535056 | 2002-06-12 | Paper |
| About the decision of reachability for register machines | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753678 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938629 | 2000-02-23 | Paper |
