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 metadatas

Cited literature [33 references]  Display  Hide  Download

https://hal.inria.fr/hal-01083657
Contributor : Marie Duflot <>
Submitted on : Wednesday, October 28, 2015 - 3:51:36 PM
Last modification on : Tuesday, February 19, 2019 - 3:40:03 PM
Long-term archiving on : Friday, April 28, 2017 - 6:15:57 AM

File

versionjournal.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

307

Files downloads

208