A decidable class of security protocols for both reachability and equivalence properties - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2020

A decidable class of security protocols for both reachability and equivalence properties

Abstract

We identify a new decidable class of security protocols, both for reachability and equivalence properties. Our result holds for an unbounded number of sessions and for protocols with nonces. It covers all standard cryptographic primitives. Our class sets up three main assumptions. (i) Protocols need to be without else branch and "simple", meaning that an attacker can precisely identify from which participant and which session a message originates from. (ii) Protocols should be type-compliant which is intuitively guaranteed as soon as two encrypted messages of the protocol cannot be confused. (iii) Finally, we define the notion of dependency graph, which given a protocol, characterises how actions depend from the other ones. As soon as the graph is acyclic then the protocol falls into our class. We show that many protocols of the literature belong to our decidable class, including for example some of the protocols embedded in the biometric passport.
Fichier principal
Vignette du fichier
main-HAL.pdf (482.77 Ko) Télécharger le fichier
protocol-files-v2.zip (814.71 Ko) Télécharger le fichier
protocol-files.zip (407.45 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Comment : This repository contains the (updated) specification of the protocols considered in the Case Studies Section, together with their associated dependency graph.
Comment : Please rather use the updated version, protocol-files-v2.zip. This repository contains the specification of the protocols considered in the Case Studies Section, together with their associated dependency graph.
Loading...

Dates and versions

hal-02446170 , version 1 (20-01-2020)

Identifiers

  • HAL Id : hal-02446170 , version 1

Cite

Véronique Cortier, Stéphanie Delaune, Vaishnavi Sundararajan. A decidable class of security protocols for both reachability and equivalence properties. [Research Report] Loria & Inria Grand Est; Irisa. 2020. ⟨hal-02446170⟩
135 View
138 Download

Share

Gmail Facebook Twitter LinkedIn More