Formal Analysis of Combinations of Secure Protocols

Abstract : When trying to prove the security of a protocol, one usually analyzes the protocol in isolation, i.e., in a network with no other protocols. But in reality, there will be many protocols operating on the same network, maybe even sharing data including keys, and an intruder may use messages of one protocol to break another. We call that a multi-protocol attack. In this paper, we try to find such attacks using the Tamarin prover. We analyze both examples that were previously analyzed by hand or using other tools, and find novel attacks.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [29 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01596010
Contributor : Jannik Dreier <>
Submitted on : Saturday, November 11, 2017 - 9:29:08 PM
Last modification on : Wednesday, April 3, 2019 - 1:23:10 AM
Document(s) archivé(s) le : Monday, February 12, 2018 - 12:28:47 PM

File

article.pdf
Files produced by the author(s)

Identifiers

Citation

Elliott Blot, Jannik Dreier, Pascal Lafourcade. Formal Analysis of Combinations of Secure Protocols. FPS 2017 - 10th International Symposium on Foundations & Practice of Security, Oct 2017, Nancy, France. pp.53-67, ⟨10.1007/978-3-319-75650-9_4⟩. ⟨hal-01596010v2⟩

Share

Metrics

Record views

282

Files downloads

108