Formal analysis of combinations of secure protocols

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Blot, E., Dreier, J., & Lafourcade, P. (2018). Formal analysis of combinations of secure protocols. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10723 LNCS, pp. 53–67). Springer Verlag. https://doi.org/10.1007/978-3-319-75650-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free