Skip to Main content Skip to Navigation
Journal articles

Typing messages for free in security protocols

Abstract : Security properties of cryptographic protocols are typically expressed as reachability or equivalence properties. Secrecy and authentication are examples of reachability properties while privacy properties such as untraceability, vote secrecy, or anonymity are generally expressed as behavioral equivalence in a process algebra that models security protocols. Our main contribution is to reduce the search space for attacks for reachability as well as equivalence properties. Specifically, we show that if there is an attack then there is one that is well-typed. Our result holds for a large class of typing systems, a family of equational theories that encompasses all standard primitives, and protocols without else branches. For many standard protocols, we deduce that it is sufficient to look for attacks that follow the format of the messages expected in an honest execution, therefore considerably reducing the search space. CCS classification: Security and privacy/Formal methods and theory of security/Logic and verification
Document type :
Journal articles
Complete list of metadata

Cited literature [43 references]  Display  Hide  Download
Contributor : Véronique Cortier <>
Submitted on : Tuesday, August 20, 2019 - 6:54:02 PM
Last modification on : Monday, February 22, 2021 - 12:11:48 PM
Long-term archiving on: : Thursday, January 9, 2020 - 9:54:06 PM


Files produced by the author(s)



Rémy Chrétien, Véronique Cortier, Antoine Dallon, Stéphanie Delaune. Typing messages for free in security protocols. ACM Transactions on Computational Logic, Association for Computing Machinery, 2020, 21 (1), ⟨10.1145/3343507⟩. ⟨hal-02268400⟩



Record views


Files downloads