A decision procedure for the verification of security protocols with explicit destructors. - Stéphanie Delaune; Florent Jacquemard (CCS, 2004)

A Theory of Dictionary Attacks and its Complexity. - Stéphanie Delaune; Florent Jacquemard (CSFW, 2004)

The Finite Variant Property: How to Get Rid of Some Algebraic Properties. - Hubert Comon-Lundh; Stéphanie Delaune (RTA, 2005)

Coercion-Resistance and Receipt-Freeness in Electronic Voting. - Stéphanie Delaune; Steve Kremer; Mark Ryan 001 (CSFW, 2006)

Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or. - Stéphanie Delaune; Pascal Lafourcade 001; Denis Lugiez; Ralf Treinen (ICALP (2), 2006)

Easy intruder deduction problems with homomorphisms. - Stéphanie Delaune (Inf. Process. Lett., 2006)

Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks. - Stéphanie Delaune; Florent Jacquemard (J. Autom. Reason., 2006)

A survey of algebraic properties used in cryptographic protocols. - Véronique Cortier; Stéphanie Delaune; Pascal Lafourcade 001 (J. Comput. Secur., 2006)

An undecidability result for AGh. - Stéphanie Delaune (Theor. Comput. Sci., 2006)

Vérification des protocoles cryptographiques et propriétés algébriques. (Verification of cryptographic protocols with algebraic properties). - Stéphanie Delaune (2006)

Deducibility Constraints, Equational Theory and Electronic Money. - Sergiu Bursuc; Hubert Comon-Lundh; Stéphanie Delaune (Rewriting, Computation and Proof, 2007)

A Formal Theory of Key Conjuring. - Véronique Cortier; Stéphanie Delaune; Graham Steel (CSF, 2007)

Combining Algorithms for Deciding Knowledge in Security Protocols. - Mathilde Arnaud; Véronique Cortier; Stéphanie Delaune (FroCoS, 2007)

Safely Composing Security Protocols. - Véronique Cortier; Jérémie Delaitre; Stéphanie Delaune (FSTTCS, 2007)

Deciding Knowledge in Security Protocols for Monoidal Equational Theories. - Véronique Cortier; Stéphanie Delaune (LPAR, 2007)

Protocol Verification Via Rigid/Flexible Resolution. - Stéphanie Delaune; Hai Lin 005; Christopher Lynch (LPAR, 2007)

Associative-Commutative Deducibility Constraints. - Sergiu Bursuc; Hubert Comon-Lundh; Stéphanie Delaune (STACS, 2007)

Composition of Password-Based Protocols. - Stéphanie Delaune; Steve Kremer; Mark Ryan 001 (CSF, 2008)

Formal Analysis of PKCS#11. - Stéphanie Delaune; Steve Kremer; Graham Steel (CSF, 2008)

Automatic Verification of Privacy Properties in the Applied pi Calculus. - Stéphanie Delaune; Mark Ryan 001; Ben Smyth (IFIPTM, 2008)

From One Session to Many: Dynamic Tags for Security Protocols. - Myrto Arapinis; Stéphanie Delaune; Steve Kremer (LPAR, 2008)

Symbolic protocol analysis for monoidal equational theories. - Stéphanie Delaune; Pascal Lafourcade 001; Denis Lugiez; Ralf Treinen (Inf. Comput., 2008)

Deducibility Constraints. - Sergiu Bursuc; Hubert Comon-Lundh; Stéphanie Delaune (ASIAN, 2009)

A Method for Proving Observational Equivalence. - Véronique Cortier; Stéphanie Delaune (CSF, 2009)

Epistemic Logic for the Applied Pi Calculus. - Rohit Chadha; Stéphanie Delaune; Steve Kremer (FMOODS/FORTE, 2009)

Safely composing security protocols. - Véronique Cortier; Stéphanie Delaune (Formal Methods Syst. Des., 2009)

Simulation based security in the applied pi calculus. - Stéphanie Delaune; Steve Kremer; Olivier Pereira (IACR Cryptol. ePrint Arch., 2009)

Verifying privacy-type properties of electronic voting protocols. - Stéphanie Delaune; Steve Kremer; Mark Ryan 001 (J. Comput. Secur., 2009)

Automating Security Analysis: Symbolic Equivalence of Constraint Systems. - Vincent Cheval; Hubert Comon-Lundh; Stéphanie Delaune (IJCAR, 2010)

Formal Analysis of Privacy for Vehicular Mix-Zones. - Morten Dahl; Stéphanie Delaune; Graham Steel (ESORICS, 2010)

A Formal Analysis of Authentication in the TPM. - Stéphanie Delaune; Steve Kremer; Mark Dermot Ryan; Graham Steel (Formal Aspects in Security and Trust, 2010)

Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster. - Stéphanie Delaune; Steve Kremer; Mark Ryan 001 (Towards Trustworthy Elections, 2010)

Symbolic bisimulation for the applied pi calculus. - Stéphanie Delaune; Steve Kremer; Mark Dermot Ryan (J. Comput. Secur., 2010)

Formal security analysis of PKCS#11 and proprietary extensions. - Stéphanie Delaune; Steve Kremer; Graham Steel (J. Comput. Secur., 2010)

Constraint solving techniques and enriching the model with equational theories. - Hubert Comon-Lundh; Stéphanie Delaune; Jonathan K. Millen (Formal Models and Techniques for Analyzing Security Protocols, 2011)

Deciding Security for Protocols with Recursive Tests. - Mathilde Arnaud; Véronique Cortier; Stéphanie Delaune (CADE, 2011)

Trace equivalence decision: negative tests and non-determinism. - Vincent Cheval; Hubert Comon-Lundh; Stéphanie Delaune (CCS, 2011)

Formal Analysis of Protocols Based on TPM State Registers. - Stéphanie Delaune; Steve Kremer; Mark Dermot Ryan; Graham Steel (CSF, 2011)

Transforming Password Protocols to Compose. - Céline Chevalier; Stéphanie Delaune; Steve Kremer (FSTTCS, 2011)

Formal Analysis of Privacy for Anonymous Location Based Services. - Morten Dahl; Stéphanie Delaune; Graham Steel (TOSCA, 2011)

Security Protocols, Constraint Systems, and Group Theories. - Stéphanie Delaune; Steve Kremer; Daniel Pasaila (IJCAR, 2012)

Verifying Privacy-Type Properties in a Modular Way. - Myrto Arapinis; Vincent Cheval; Stéphanie Delaune (CSF, 2012)

Analysing Routing Protocols: Four Nodes Topologies Are Sufficient. - Véronique Cortier; Jan Degrieck; Stéphanie Delaune (POST, 2012)

Computing Knowledge in Security Protocols Under Convergent Equational Theories. - Stefan Ciobaca; Stéphanie Delaune; Steve Kremer (J. Autom. Reason., 2012)

Decidability and Combination Results for Two Notions of Knowledge in Security Protocols. - Véronique Cortier; Stéphanie Delaune (J. Autom. Reason., 2012)

Formal Security Proofs. - Hubert Comon-Lundh; Stéphanie Delaune (Software Safety and Security, 2012)

Formal Analysis of Privacy for Routing Protocols in Mobile Ad Hoc Networks. - Rémy Chrétien; Stéphanie Delaune (POST, 2013)

Composition of password-based protocols. - Céline Chevalier; Stéphanie Delaune; Steve Kremer; Mark Dermot Ryan (Formal Methods Syst. Des., 2013)

Deciding equivalence-based properties using constraint solving. - Vincent Cheval; Véronique Cortier; Stéphanie Delaune (Theor. Comput. Sci., 2013)

YAPA: A Generic Tool for Computing Intruder Knowledge. - Mathieu Baudet; Véronique Cortier; Stéphanie Delaune (ACM Trans. Comput. Log., 2013)

Typing Messages for Free in Security Protocols: The Case of Equivalence Properties. - Rémy Chrétien; Véronique Cortier; Stéphanie Delaune (CONCUR, 2014)

A Reduced Semantics for Deciding Trace Equivalence Using Constraint Systems. - David Baelde; Stéphanie Delaune; Lucca Hirschi (POST, 2014)

Tests for Establishing Security Properties. - Vincent Cheval; Stéphanie Delaune; Mark Ryan 001 (TGC, 2014)

Dynamic Tags for Security Protocols. - Myrto Arapinis; Stéphanie Delaune; Steve Kremer (Log. Methods Comput. Sci., 2014)

Modeling and verifying ad hoc routing protocols. - Mathilde Arnaud; Véronique Cortier; Stéphanie Delaune (Inf. Comput., 2014)

Deducibility constraints and blind signatures. - Sergiu Bursuc; Hubert Comon-Lundh; Stéphanie Delaune (Inf. Comput., 2014)

Partial Order Reduction for Security Protocols. - David Baelde; Stéphanie Delaune; Lucca Hirschi (CONCUR, 2015)

Decidability of Trace Equivalence for Protocols with Nonces. - Rémy Chrétien; Véronique Cortier; Stéphanie Delaune (CSF, 2015)

Checking Trace Equivalence: How to Get Rid of Nonces? - Rémy Chrétien; Véronique Cortier; Stéphanie Delaune (ESORICS (2), 2015)

Composing Security Protocols: From Confidentiality to Privacy. - Myrto Arapinis; Vincent Cheval; Stéphanie Delaune (POST, 2015)

From Security Protocols to Pushdown Automata. - Rémy Chrétien; Véronique Cortier; Stéphanie Delaune (ACM Trans. Comput. Log., 2015)

Bounding the Number of Agents, for Equivalence Too. - Véronique Cortier; Antoine Dallon; Stéphanie Delaune (POST, 2016)

A Method for Verifying Privacy-Type Properties: The Unbounded Case. - Lucca Hirschi; David Baelde; Stéphanie Delaune (IEEE Symposium on Security and Privacy, 2016)

Symbolic Verification of Privacy-Type Properties for Security Protocols with XOR. - David Baelde; Stéphanie Delaune; Ivan Gazeau; Steve Kremer (CSF, 2017)

SAT-Equiv: An Efficient Tool for Equivalence Properties. - Véronique Cortier; Antoine Dallon; Stéphanie Delaune (CSF, 2017)

Formal Verification of Protocols Based on Short Authenticated Strings. - Stéphanie Delaune; Steve Kremer; Ludovic Robin (CSF, 2017)

A procedure for deciding symbolic equivalence between sets of constraint systems. - Vincent Cheval; Hubert Comon-Lundh; Stéphanie Delaune (Inf. Comput., 2017)

A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols. - Stéphanie Delaune; Lucca Hirschi (J. Log. Algebraic Methods Program., 2017)

A Reduced Semantics for Deciding Trace Equivalence. - David Baelde; Stéphanie Delaune; Lucca Hirschi (Log. Methods Comput. Sci., 2017)

PLAS 2018 - ACM SIGSAC Workshop on Programming Languages and Analysis for Security. - Mário S. Alvim; Stéphanie Delaune (CCS, 2018)

POR for Security Protocol Equivalences - Beyond Action-Determinism. - David Baelde; Stéphanie Delaune; Lucca Hirschi (ESORICS (1), 2018)

Efficiently Deciding Equivalence for Standard Primitives and Phases. - Véronique Cortier; Antoine Dallon; Stéphanie Delaune (ESORICS (1), 2018)

A Symbolic Framework to Analyse Physical Proximity in Security Protocols. - Alexandre Debant; Stéphanie Delaune; Cyrille Wiedling (FSTTCS, 2018)

Analysing Privacy-Type Properties in Cryptographic Protocols (Invited Talk). - Stéphanie Delaune (FSCD, 2018)

POPSTAR: so near and yet so far. - Stéphanie Delaune (ACM SIGLOG News, 2018)

Symbolic Analysis of Terrorist Fraud Resistance. - Alexandre Debant; Stéphanie Delaune; Cyrille Wiedling (ESORICS (1), 2019)

Symbolic Verification of Distance Bounding Protocols. - Alexandre Debant; Stéphanie Delaune (POST, 2019)

A method for unbounded verification of privacy-type properties. - Lucca Hirschi; David Baelde; Stéphanie Delaune (J. Comput. Secur., 2019)

Security Analysis and Implementation of Relay-Resistant Contactless Payments. - Ioana Boureanu; Tom Chothia; Alexandre Debant; Stéphanie Delaune (CCS, 2020)

A Method for Proving Unlinkability of Stateful Protocols. - David Baelde; Stéphanie Delaune; Solène Moreau (CSF, 2020)

Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols. - Véronique Cortier; Stéphanie Delaune; Jannik Dreier (ESORICS (2), 2020)

Rewriting in Protocol Verification. - Stéphanie Delaune (UNIF, 2020)

SKINNY with Scalpel - Comparing Tools for Differential Analysis. - Stéphanie Delaune; Patrick Derbez; Paul Huynh; Marine Minier; Victor Mollimard; Charles Prud'homme (IACR Cryptol. ePrint Arch., 2020)

Typing Messages for Free in Security Protocols. - Rémy Chrétien; Véronique Cortier; Antoine Dallon; Stéphanie Delaune (ACM Trans. Comput. Log., 2020)

Catching the Fastest Boomerangs Application to SKINNY. - Stéphanie Delaune; Patrick Derbez; Mathieu Vavrille (IACR Trans. Symmetric Cryptol., 2020)

Efficient Methods to Search for Best Differential Characteristics on SKINNY. - Stéphanie Delaune; Patrick Derbez; Paul Huynh; Marine Minier; Victor Mollimard; Charles Prud'homme (ACNS (2), 2021)

A Simpler Model for Recovering Superpoly on Trivium. - Stéphanie Delaune; Patrick Derbez; Arthur Gontier; Charles Prud'homme (SAC, 2021)

An Interactive Prover for Protocol Verification in the Computational Model. - David Baelde; Stéphanie Delaune; Charlie Jacomme; Adrien Koutsos; Solène Moreau (SP, 2021)

A Simpler Model for Recovering Superpoly onTrivium. - Stéphanie Delaune; Patrick Derbez; Arthur Gontier; Charles Prud'homme (IACR Cryptol. ePrint Arch., 2021)

A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties. - Véronique Cortier; Stéphanie Delaune; Vaishnavi Sundararajan (J. Autom. Reason., 2021)

Cracking the Stateful Nut: Computational Proofs of Stateful Security Protocols using the Squirrel Proof Assistant. - David Baelde; Stéphanie Delaune; Adrien Koutsos; Solène Moreau (CSF, 2022)

A small bound on the number of sessions for security protocols. - Véronique Cortier; Antoine Dallon; Stéphanie Delaune (CSF, 2022)

One Vote Is Enough for Analysing Privacy. - Stéphanie Delaune; Joseph Lallemand (ESORICS (1), 2022)

Automatic generation of sources lemmas in Tamarin: Towards automatic proofs of security protocols. - Véronique Cortier; Stéphanie Delaune; Jannik Dreier; Elise Klein 002 (J. Comput. Secur., 2022)

So Near and Yet So Far - Symbolic Verification of Distance-Bounding Protocols. - Alexandre Debant; Stéphanie Delaune; Cyrille Wiedling (ACM Trans. Priv. Secur., 2022)

Proving Unlinkability Using ProVerif Through Desynchronised Bi-Processes. - David Baelde; Alexandre Debant; Stéphanie Delaune (CSF, 2023)

Tamarin-Based Analysis of Bluetooth Uncovers Two Practical Pairing Confusion Attacks. - Tristan Claverie; Gildas Avoine; Stéphanie Delaune; José Lopes-Esteves (ESORICS (3), 2023)

New Algorithm for Exhausting Optimal Permutations for Generalized Feistel Networks. - Stéphanie Delaune; Patrick Derbez; Arthur Gontier; Charles Prud'homme (IACR Cryptol. ePrint Arch., 2023)

Formal Security Analysis of Widevine through the W3C EME Standard. - Stéphanie Delaune; Joseph Lallemand; Gwendal Patat; Florian Roudot; Mohamed Sabt (USENIX Security Symposium, 2024)

The Squirrel Prover and its Logic. - David Baelde; Stéphanie Delaune; Charlie Jacomme; Adrien Koutsos; Joseph Lallemand (ACM SIGLOG News, 2024)

Formal Analysis of Random Nonce Misuses in Cryptographic Protocols. - Gildas Avoine; Tristan Claverie; Stéphanie Delaune (CSF, 2025)

SMT-Based Automation for Overwhelming Truth. - David Baelde; Stéphanie Delaune; Stanislas Riou (CSF, 2025)

Secrecy by Typing in the Computational Model. - Stéphanie Delaune; Clément Hérouard; Joseph Lallemand (CSF, 2025)

Is one vote really enough? Vote privacy with re-voting and a dishonest ballot box. - Stéphanie Delaune; Joseph Lallemand; Arthur Outrey (J. Comput. Secur., 2025)