Skip to Main content Skip to Navigation
New interface
Journal articles

Bounding messages for free in security protocols – extension to various security properties

Myrto Arapinis 1 Marie Duflot 2 
2 VERIDIS - Modeling and Verification of Distributed Algorithms and Systems
MPII - Max-Planck-Institut für Informatik, Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : While the verification of security protocols has been proved to be undecidable in general, several approaches use simplifying hypotheses in order to obtain decidability for interesting subclasses. Amongst the most common is type abstraction, i.e. considering only well-typed runs of the protocol, therefore bounding message length. In this paper, we show how to get message boundedness “for free” under a reasonable (syntactic) assumption on protocols, in order to verify a variety of interesting security properties including secrecy and several authentication properties. This enables us to improve existing decidability results by restricting the search space for attacks.
Complete list of metadata

Cited literature [33 references]  Display  Hide  Download
Contributor : Marie Duflot Connect in order to contact the contributor
Submitted on : Wednesday, October 28, 2015 - 3:51:36 PM
Last modification on : Saturday, June 25, 2022 - 7:44:56 PM
Long-term archiving on: : Friday, April 28, 2017 - 6:15:57 AM


Files produced by the author(s)




Myrto Arapinis, Marie Duflot. Bounding messages for free in security protocols – extension to various security properties. Information and Computation, 2014, pp.34. ⟨10.1016/j.ic.2014.09.003⟩. ⟨hal-01083657⟩



Record views


Files downloads