| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7650814 (Why is no real title available?) | 2023-02-07 | Paper |
Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols
1511.68042 | 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
Journal of Automated Reasoning | 2021-06-09 | Paper |
| Belenios: a simple private and verifiable electronic voting system | 2020-03-03 | Paper |
Typing messages for free in security protocols
ACM Transactions on Computational Logic | 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
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
YAPA: a generic tool for computing intruder knowledge
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Deciding security properties for cryptographic protocols. application to key cycles
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Modeling and verifying ad hoc routing protocols
Information and Computation | 2014-10-20 | Paper |
A generic security API for symmetric key management on cryptographic devices
Information and Computation | 2014-10-20 | Paper |
Electronic Voting: How Logic Can Help
Automated Reasoning | 2014-09-26 | Paper |
Typing messages for free in security protocols: the case of equivalence properties
CONCUR 2014 – Concurrency Theory | 2014-09-15 | Paper |
Deciding equivalence-based properties using constraint solving
Theoretical Computer Science | 2014-01-10 | Paper |
Explicit randomness is not necessary when modeling probabilistic encryption
Electronic Notes in Theoretical Computer Science | 2013-12-13 | Paper |
From security protocols to pushdown automata
Automata, Languages, and Programming | 2013-08-07 | Paper |
Practical Everlasting Privacy
Lecture Notes in Computer Science | 2013-08-06 | Paper |
Tractable inference systems: an extension with a deducibility predicate
Automated Deduction – CADE-24 | 2013-06-14 | Paper |
| Relating two standard notions of secrecy | 2012-09-28 | Paper |
Secure composition of protocols
Theory of Security and Applications | 2012-08-22 | Paper |
Decidability and combination results for two notions of knowledge in security protocols
Journal of Automated Reasoning | 2012-07-17 | Paper |
Analysing routing protocols: four nodes topologies are sufficient
Lecture Notes in Computer Science | 2012-06-29 | Paper |
Security proof with dishonest keys
Lecture Notes in Computer Science | 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
RAIRO - Theoretical Informatics and Applications | 2011-10-28 | Paper |
Deciding security for protocols with recursive tests
Lecture Notes in Computer Science | 2011-07-29 | Paper |
A survey of symbolic methods in computational analysis of cryptographic systems
Journal of Automated Reasoning | 2011-06-03 | Paper |
Safely composing security protocols
Formal Methods in System Design | 2009-07-06 | Paper |
YAPA: A Generic Tool for Computing Intruder Knowledge
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Computationally sound implementations of equational theories against passive adversaries
Information and Computation | 2009-04-16 | Paper |
Relating Two Standard Notions of Secrecy
Computer Science Logic | 2009-03-12 | Paper |
Combining Algorithms for Deciding Knowledge in Security Protocols
Frontiers of Combining Systems | 2008-09-16 | Paper |
Deciding Key Cycles for Security Protocols
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-15 | Paper |
Safely Composing Security Protocols
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science | 2008-04-24 | Paper |
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Relating two standard notions of secrecy
Logical Methods in Computer Science | 2007-11-15 | Paper |
Automatic Analysis of the Security of XOR-Based Key Management Schemes
Tools and Algorithms for the Construction and Analysis of Systems | 2007-09-03 | Paper |
Deciding knowledge in security protocols under equational theories
Theoretical Computer Science | 2007-01-09 | Paper |
A note on maximally repeated sub-patterns of a point set
Discrete Mathematics | 2006-09-14 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2005-09-13 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Tree automata with one memory set constraints and cryptographic protocols
Theoretical Computer Science | 2005-04-06 | Paper |
Security properties: two agents are sufficient
Science of Computer Programming | 2004-11-22 | Paper |
| scientific article; zbMATH DE number 2043527 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 1956548 (Why is no real title available?) | 2003-07-30 | Paper |
| scientific article; zbMATH DE number 1754629 (Why is no real title available?) | 2002-06-12 | Paper |
About the decision of reachability for register machines
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
About the decision of reachability for register machines
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
About the decision of reachability for register machines
RAIRO - Theoretical Informatics and Applications | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1670482 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1405649 (Why is no real title available?) | 2000-02-23 | Paper |
