| Publication | Date of Publication | Type |
|---|
| A simpler model for recovering superpoly on Trivium | 2024-10-14 | Paper |
| New algorithm for exhausting optimal permutations for generalized Feistel networks | 2023-08-14 | Paper |
| One vote is enough for analysing privacy | 2023-07-21 | 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 |
| POR for security protocol equivalences. Beyond action-determinism | 2022-08-25 | Paper |
| Checking trace equivalence: how to get rid of nonces? | 2022-08-19 | Paper |
| A Symbolic Framework to Analyse Physical Proximity in Security Protocols | 2022-07-21 | Paper |
| Analysing privacy-type properties in cryptographic protocols (invited talk) | 2021-06-15 | Paper |
| A decidable class of security protocols for both reachability and equivalence properties | 2021-06-09 | Paper |
| Typing messages for free in security protocols | 2019-11-22 | Paper |
| Partial order reduction for security protocols | 2017-09-12 | Paper |
| A procedure for deciding symbolic equivalence between sets of constraint systems | 2017-08-08 | Paper |
| From security protocols to pushdown automata | 2017-07-12 | Paper |
| A reduced semantics for deciding trace equivalence | 2017-06-22 | Paper |
| A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols | 2017-02-22 | Paper |
| YAPA: a generic tool for computing intruder knowledge | 2015-09-17 | Paper |
| Modeling and verifying ad hoc routing protocols | 2014-10-20 | Paper |
| Deducibility constraints and blind signatures | 2014-10-20 | Paper |
| Typing messages for free in security protocols: the case of equivalence properties | 2014-09-15 | Paper |
| Composition of password-based protocols | 2014-06-30 | Paper |
| Dynamic tags for security protocols | 2014-06-23 | Paper |
| Deciding equivalence-based properties using constraint solving | 2014-01-10 | Paper |
| From security protocols to pushdown automata | 2013-08-07 | Paper |
| Formal analysis of privacy for routing protocols in mobile ad hoc networks | 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 |
| Transforming password protocols to compose | 2012-08-31 | Paper |
| Formal Analysis of Privacy for Anonymous Location Based Services | 2012-08-22 | Paper |
| Computing knowledge in security protocols under convergent equational theories | 2012-07-17 | 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 |
| Deciding security for protocols with recursive tests | 2011-07-29 | Paper |
| Automating security analysis: symbolic equivalence of constraint systems | 2010-09-14 | Paper |
| Verifying privacy-type properties of electronic voting protocols: a taster | 2010-06-17 | Paper |
| Deducibility constraints | 2010-01-14 | Paper |
| Easy intruder deduction problems with homomorphisms | 2009-12-18 | Paper |
| Computing Knowledge in Security Protocols under Convergent Equational Theories | 2009-07-28 | Paper |
| Safely composing security protocols | 2009-07-06 | Paper |
| YAPA: A Generic Tool for Computing Intruder Knowledge | 2009-06-30 | Paper |
| Deducibility Constraints, Equational Theory and Electronic Money | 2009-03-06 | Paper |
| From One Session to Many: Dynamic Tags for Security Protocols | 2009-01-27 | Paper |
| Combining Algorithms for Deciding Knowledge in Security Protocols | 2008-09-16 | Paper |
| Deciding Knowledge in Security Protocols for Monoidal Equational Theories | 2008-05-15 | Paper |
| Protocol Verification Via Rigid/Flexible Resolution | 2008-05-15 | Paper |
| Symbolic Bisimulation for the Applied Pi Calculus | 2008-04-24 | Paper |
| Safely Composing Security Protocols | 2008-04-24 | Paper |
| Symbolic protocol analysis for monoidal equational theories | 2008-04-16 | Paper |
| Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or | 2007-09-11 | Paper |
| Associative-Commutative Deducibility Constraints | 2007-09-03 | Paper |
| Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks | 2007-01-30 | Paper |
| An undecidability result for AGh | 2007-01-22 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
