Decidability of trace equivalence for protocols with nonces - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2015

Decidability of trace equivalence for protocols with nonces

Abstract

Privacy properties such as anonymity, unlinkability, or vote secrecy are typically expressed as equivalence properties. In this paper, we provide the first decidability result for trace equivalence of security protocols, for an unbounded number of sessions and unlimited fresh nonces. Our class encompasses most symmetric key protocols of the literature, in their tagged variant.
Fichier principal
Vignette du fichier
CCD-csf15.pdf (370.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01206276 , version 1 (28-09-2015)

Identifiers

Cite

Rémy Chrétien, Véronique Cortier, Stéphanie Delaune. Decidability of trace equivalence for protocols with nonces. 28th IEEE Computer Security Foundations Symposium (CSF'15), Jul 2015, Verona, Italy. ⟨10.1109/CSF.2015.19⟩. ⟨hal-01206276⟩
134 View
107 Download

Altmetric

Share

Gmail Facebook X LinkedIn More