Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR

Abstract : Exclusive-or (XOR) operations are common in cryptographic protocols, in particular in RFID protocols and electronic payment protocols. Although there are numerous applications , due to the inherent complexity of faithful models of XOR, there is only limited tool support for the verification of cryptographic protocols using XOR. The TAMARIN prover is a state-of-the-art verification tool for cryptographic protocols in the symbolic model. In this paper, we improve the underlying theory and the tool to deal with an equational theory modeling XOR operations. The XOR theory can be freely combined with all equational theories previously supported, including user-defined equational theories. This makes TAMARIN the first tool to support simultaneously this large set of equational theories, protocols with global mutable state, an unbounded number of sessions, and complex security properties including observational equivalence. We demonstrate the effectiveness of our approach by analyzing several protocols that rely on XOR, in particular multiple RFID-protocols, where we can identify attacks as well as provide proofs.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [53 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01780603
Contributor : Jannik Dreier <>
Submitted on : Friday, April 27, 2018 - 4:35:19 PM
Last modification on : Wednesday, April 3, 2019 - 1:23:10 AM
Document(s) archivé(s) le : Tuesday, September 25, 2018 - 1:09:43 PM

File

paper-final.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jannik Dreier, Lucca Hirschi, Sasa Radomirovic, Ralf Sasse. Automated Unbounded Verification of Stateful Cryptographic Protocols with Exclusive OR. CSF'2018 - 31st IEEE Computer Security Foundations Symposium, Jul 2018, Oxford, United Kingdom. ⟨10.1109/CSF.2018.00033⟩. ⟨hal-01780603⟩

Share

Metrics

Record views

255

Files downloads

239