The inductive approach to strand space

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Strand space is a promising technique developed by Guttman et al. from MITRE company, and it provides us an intuitive and clear framework to analyze security protocols, but its mechanics of the proof tend to be quite intricate and not necessarily easy to be formalized. In this paper, we combine the inductive approach with strand space. We introduce an inductive definition for bundles, and it not only provides us a constructive illustration for a bundle, but also introduces an effective and rigorous technique of rule induction to prove properties of bundles. Using this induction principle, we not only prove that a bundle is a casually well-founded graph, but also give a rigorous proof for results of authentication tests. Our result of authentication test extends Guttman's result to a more general case, and its proof is also much easier and clearer. As a trivial case study, we prove authentication properties of Needham-Schroeder-Lowe protocol. Our approach has been mechanized using Isabelle/HOL. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Li, Y. (2005). The inductive approach to strand space. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3731 LNCS, pp. 547–552). Springer Verlag. https://doi.org/10.1007/11562436_43

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