Publications

2022

  • David Baelde, Stéphanie Delaune, Adrien Koutsos, and Solène Moreau.  Cracking the Stateful Nut: Computational Proofs of Stateful Security Protocols using the SQUIRREL Proof Assistant. In Proceedings of the 35th IEEE Computer Security Foundations Symposium (CSF’22), Haifa, Israel, August 2022. Distinguished paper award.
  • Véronique Cortier, Antoine Dallon, and Stéphanie Delaune. A small bound on the number of sessions for security protocols. In Proceedings of the 35th IEEE Computer Security Foundations Symposium (CSF’22), Haifa, Israel, August 2022.
  • Stéphanie Delaune, and Joseph Lallemand. One vote is enough for analysing privacy. In Proceedings of  the 27th European Symposium on Research in Computer Security (ESORICS’22), Lecture Notes in Computer Science, Springer, Copenhagen, Denmark, September 2022.
  • Alexandre Debant, Stéphanie Delaune, and Cyrille Wiedling. So Near and Yet So Far – Symbolic Verification of Distance-Bounding Protocols. ACM Transaction Privacy and Security 25(2): 11:1-11:39, 2022.
  • Véronique Cortier, Stéphanie Delaune, Jannik Dreier, and Élise Klein. Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols. Journal of Computer Security. To appear.

2021

  • Véronique Cortier, Stéphanie Delaune, Vaishnavi Sundararajan. A Decidable Class of Security Protocols for Both Reachability and Equivalence Properties. Journal of . Automated Reasoning. 65(4): 479-520. 2021.
  • David Baelde, Stéphanie Delaune, Charlie Jacomme, Adrien Koutsos, and Solène Moreau. An Interactive Prover for Protocol Verification in the Computational Model. In Proceedings of the 42nd IEEE Symposium on Security and Privacy (S&P’21), IEEE Computer Society Press, San Francisco, California, USA, May 2021.

2020

  • David Baelde,  Stéphanie Delaune, and Solène Moreau. A method for proving unlinkability of stateful protocols. In Proceedings of the 33rd IEEE Computer Security Foundations Symposium (CSF’20), IEEE Computer Society Press, Virtual conference, June 2020. Distinguished paper award.
  • Véronique Cortier, Stéphanie Delaune, Jannik Dreier. Automatic Generation of Sources Lemmas in Tamarin: Towards Automatic Proofs of Security Protocols. In Proceedings of  the 25th European Symposium on Research in Computer Security (ESORICS’20), Lecture Notes in Computer Science, Springer, Virtual conference, 2020. Best paper award.
  • Ioana Boureanu, Tom Chothia, Alexandre Debant, and Stéphanie Delaune. Security Analysis and Implementation of Relay-Resistant Contactless Payments. In Proceedings of the 27th ACM Conference on Computer and Communications Security (CCS’20), ACM Press, Virtual conference, November 2020.
  • Rémy Chrétien, Véronique Cortier, Antoine Dallon, and Stéphanie Delaune. Typing messages for free in security protocols. ACM Transactions on Computational Logic, 2020.

2019

  • Lucca Hirschi, David Baelde, and Stéphanie Delaune. A method for unbounded verification of privacy-type properties. Journal of Computer Security, 2019.
  • Alexandre Debant, Stéphanie Delaune, and Cyrille Wiedling. Symbolic analysis of terrorist fraud resistance. In Proceedings of  the 24th European Symposium on Research in Computer Security (ESORICS’19), Lecture Notes in Computer Science, Springer, Luxembourg, 2019.
  • Alexandre Debant, and Stéphanie Delaune. Symbolic Verification of Distance Bounding Protocols. In Proceedings of the 8th International Conference on Principles of Security and Trust (POST’19), Spinger, Prague, Czech Republic, 2019.

2018

  • Alexandre Debant, Stéphanie Delaune, and Cyrille Wiedling. A Symbolic Framework to Analyse Physical Proximity in Security Protocols. In Proceedings of the 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS’18), Lipics,  Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, Ahmedabad, India, 2018.
  • David Baelde, Stéphanie Delaune, and Lucca Hirschi. POR for Security Protocol Equivalences — Beyond Action-Determinism. In Proceedings of the 23rd European Symposium on Research in Computer Security (ESORICS’18), Lecture Notes in Computer Science, Springer, Barcelona, Spain, 2018.
  • Véronique Cortier, Antoine Dallon, and Stéphanie Delaune. Efficiently deciding equivalence for standard primitives and phases. In Proceedings of the 23rd European Symposium on Research in Computer Security (ESORICS’18), Lecture Notes in Computer Science, Springer, Barcelona, Spain, 2018.
  • Stéphanie Delaune. Analysing Privacy-Type Properties in Cryptographic Protocols (Invited Talk). In 3rd International Conference on Formal Structures for Computation and Deduction, (FSCD’18), LIPIcs 108, Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, Oxford, UK, 2018.

2017

  • David Baelde, Stéphanie Delaune, and Lucca Hirschi. A reduced semantics for deciding trace equivalence. Logical Methods in Computer Science, 13(2), 2017.
  • David Baelde, Stéphanie Delaune, Ivan Gazeau, and Steve Kremer. Symbolic verification of privacy-type properties for security protocols with XOR. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF’17), IEEE Computer Society Press, Santa Barbara, CA, USA, August 2017.
  • Véronique Cortier and Antoine Dallon, and Stéphanie Delaune. SAT-Equiv: an efficient tool for equivalence properties. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF’17), IEEE Computer Society Press, Santa Barbara, CA, USA, August 2017.
  • Stéphanie Delaune, Steve Kremer, and Ludovic Robin. Formal verification of protocols based on short authenticated strings. In Proceedings of the 30th IEEE Computer Security Foundations Symposium (CSF’17), IEEE Computer Society Press, Santa Barbara, CA, USA, August 2017.

Comments are closed.