 | 2009 |
| 26 |  | Stefan Ciobâca,
Stéphanie Delaune,
Steve Kremer:
Computing Knowledge in Security Protocols under Convergent Equational Theories.
CADE 2009: 355-370 |
| 25 |  | Rohit Chadha,
Stéphanie Delaune,
Steve Kremer:
Epistemic Logic for the Applied Pi Calculus.
FMOODS/FORTE 2009: 182-197 |
| 24 |  | Mathieu Baudet,
Véronique Cortier,
Stéphanie Delaune:
YAPA: A Generic Tool for Computing Intruder Knowledge.
RTA 2009: 148-163 |
| 23 |  | Véronique Cortier,
Stéphanie Delaune:
Safely composing security protocols.
Formal Methods in System Design 34(1): 1-36 (2009) |
| 22 |  | Stéphanie Delaune,
Steve Kremer,
Mark Ryan:
Verifying privacy-type properties of electronic voting protocols.
Journal of Computer Security 17(4): 435-487 (2009) |
| 2008 |
| 21 |  | Stéphanie Delaune,
Steve Kremer,
Mark Ryan:
Composition of Password-Based Protocols.
CSF 2008: 239-251 |
| 20 |  | Stéphanie Delaune,
Steve Kremer,
Graham Steel:
Formal Analysis of PKCS#11.
CSF 2008: 331-344 |
| 19 |  | Myrto Arapinis,
Stéphanie Delaune,
Steve Kremer:
From One Session to Many: Dynamic Tags for Security Protocols.
LPAR 2008: 128-142 |
| 18 |  | Stéphanie Delaune,
Pascal Lafourcade,
Denis Lugiez,
Ralf Treinen:
Symbolic protocol analysis for monoidal equational theories.
Inf. Comput. 206(2-4): 312-351 (2008) |
| 2007 |
| 17 |  | Véronique Cortier,
Stéphanie Delaune,
Graham Steel:
A Formal Theory of Key Conjuring.
CSF 2007: 79-96 |
| 16 |  | Stéphanie Delaune,
Steve Kremer,
Mark Ryan:
Symbolic Bisimulation for the Applied Pi Calculus.
FSTTCS 2007: 133-145 |
| 15 |  | Véronique Cortier,
Jérémie Delaitre,
Stéphanie Delaune:
Safely Composing Security Protocols.
FSTTCS 2007: 352-363 |
| 14 |  | Mathilde Arnaud,
Véronique Cortier,
Stéphanie Delaune:
Combining Algorithms for Deciding Knowledge in Security Protocols.
FroCos 2007: 103-117 |
| 13 |  | Véronique Cortier,
Stéphanie Delaune:
Deciding Knowledge in Security Protocols for Monoidal Equational Theories.
LPAR 2007: 196-210 |
| 12 |  | Stéphanie Delaune,
Hai Lin,
Christopher Lynch:
Protocol Verification Via Rigid/Flexible Resolution.
LPAR 2007: 242-256 |
| 11 |  | Sergiu Bursuc,
Hubert Comon-Lundh,
Stéphanie Delaune:
Deducibility Constraints, Equational Theory and Electronic Money.
Rewriting, Computation and Proof 2007: 196-212 |
| 10 |  | Sergiu Bursuc,
Hubert Comon-Lundh,
Stéphanie Delaune:
Associative-Commutative Deducibility Constraints.
STACS 2007: 634-645 |
| 2006 |
| 9 |  | Stéphanie Delaune,
Steve Kremer,
Mark Ryan:
Coercion-Resistance and Receipt-Freeness in Electronic Voting.
CSFW 2006: 28-42 |
| 8 |  | Stéphanie Delaune,
Pascal Lafourcade,
Denis Lugiez,
Ralf Treinen:
Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or.
ICALP (2) 2006: 132-143 |
| 7 |  | Stéphanie Delaune:
Easy intruder deduction problems with homomorphisms.
Inf. Process. Lett. 97(6): 213-218 (2006) |
| 6 |  | Stéphanie Delaune,
Florent Jacquemard:
Decision Procedures for the Security of Protocols with Probabilistic Encryption against Offline Dictionary Attacks.
J. Autom. Reasoning 36(1-2): 85-124 (2006) |
| 5 |  | Véronique Cortier,
Stéphanie Delaune,
Pascal Lafourcade:
A survey of algebraic properties used in cryptographic protocols.
Journal of Computer Security 14(1): 1-43 (2006) |
| 4 |  | Stéphanie Delaune:
An undecidability result for AGh.
Theor. Comput. Sci. 368(1-2): 161-167 (2006) |
| 2005 |
| 3 |  | Hubert Comon-Lundh,
Stéphanie Delaune:
The Finite Variant Property: How to Get Rid of Some Algebraic Properties.
RTA 2005: 294-307 |
| 2004 |
| 2 |  | Stéphanie Delaune,
Florent Jacquemard:
A decision procedure for the verification of security protocols with explicit destructors.
ACM Conference on Computer and Communications Security 2004: 278-287 |
| 1 |  | Stéphanie Delaune,
Florent Jacquemard:
A Theory of Dictionary Attacks and its Complexity.
CSFW 2004: 2-15 |