Decidability of trace equivalence for protocols with nonces

Rémy Chrétien (1, 2) , Véronique Cortier (2) , Stéphanie Delaune (1)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 CASSIS - Combination of approaches to the security of infinite states systems

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.

Domaines: Cryptographie et sécurité [cs.CR]

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⟩