A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis
Purchase on Springer.com
$29.95 / €24.95 / £19.95*
* Final gross prices may vary according to local VAT.
Formal analysis of security protocols is largely based on a set of assumptions commonly referred to as the Dolev-Yao model. Two formalisms that state the basic assumptions of this model are related here: strand spaces [FHG98] and multiset rewriting with existential quantification [CDL+ 99,DLMS99]. Strand spaces provide a simple and economical approach to state-based analysis of completed protocol runs by emphasizing causal interactions among protocol participants. The multiset rewriting formalism provides a very precise way of specifying finite-length protocols, with a bounded initialization phase but allowing unboundedly many instances of each protocol role, such as client, server, initiator, or responder. Although it is fairly intuitive that these two languages should be equivalent in some way, a number of modifications to each system are required to obtain a meaningful equivalence. We extend the strand formalism with a way of incrementally growing bundles in order to emulate an execution of a protocol with parametric strands. We omit the initialization part of the multiset rewriting setting, which formalizes the choice of initial data, such as shared public or private keys, and which has no counterpart in the strand space setting. The correspondence between the modified formalisms directly relates the intruder theory from the multiset rewriting formalism to the penetrator strands. The relationship we illustrate here between multiset rewriting specifications and strand spaces thus suggests refinements to both frameworks, and deepens our understanding of the Dolev-Yao model.
- Frederic Butler, Iliano Cervesato, Aaron D. Jaggard, and Andre Scedrov. A Formal Analysis of Some Properties of Kerberos 5 Using MSR. In Fifteenth Computer Security Foundations Workshop-CSFW-15, pages 175–190, Cape Breton, NS, Canada, June 2002. IEEE Computer Society Press.
- Iliano Cervesato, Nancy Durgin, Max I. Kanovich, and Andre Scedrov. Interpreting Strands in Linear Logic. In H. Veith, N. Heintze, and E. Clark, editors, 2000 Workshop on Formal Methods and Computer Security-FMCS’00, Chicago, IL, July 2000.
- [CDL+ 99] Iliano Cervesato, Nancy A. Durgin, Patrick D. Lincoln, John C. Mitchell, and Andre Scedrov. A meta-notation for protocol analysis. In P. Syverson, editor, Proceedings of the 12th IEEE Computer Security Foundations Workshop-CSFW’99, pages 55–69, Mordano, Italy, June 1999. IEEE Computer Society Press.
- Iliano Cervesato, Nancy A. Durgin, Patrick D. Lincoln, John C. Mitchell, and Andre Scedrov. Relating strands and multiset rewriting for security protocol analysis. In P. Syverson, editor, 13th IEEE Computer Security Foundations Workshop-CSFW’00, pages 35–51, Cambrige, UK, 3-5 July 2000. IEEE Computer Society Press.
- Iliano Cervesato. Typed MSR: Syntax and Examples. In V.I. Gorodetski, V.A. Skormin, and L.J. Popyack, editors, First International Workshop on Mathematical Methods, Models and Architectures for Computer Networks Security-MMM’01, pages 159–177, St. Petersburg, Russia, May 2001. Springer-Verlag LNCS 2052.
- Nancy Durgin, Patrick Lincoln, John Mitchell, and Andre Scedrov. Undecidability of bounded security protocols. In N. Heintze and E. Clarke, editors, Proceedings of the Workshop on Formal Methods and Security Protocols-FMSP, Trento, Italy, July 1999. Extended version at ftp://ftp.cis.upenn.edu/pub/papers/scedrov/msr-long.ps.
- Grit Denker and Jonathan K. Millen. CAPSL Intermediate Language. In N. Heintze and E. Clarke, editors, Proceedings of the Workshop on Formal Methods and Security Protocols-FMSP, Trento, Italy, July 1999.
- Danny Dolev and Andrew C. Yao. On the security of public-key protocols. IEEE Transactions on Information Theory, 2(29):198–208, 1983. CrossRef
- F. Javier Thayer Fábrega, Jonathan C. Herzog, and Joshua D. Guttman. Strand spaces: Why is a security protocol correct? In Proceedings of the 1998 IEEE Symposium on Security and Privacy, pages 160–171, Oakland, CA, May 1998. IEEE Computer Society Press.
- F. Javier Thayer Fábrega, Jonathan C. Herzog, and Joshua D. Guttman. Mixed strand spaces. In P. Syverson, editor, Proceedings of the 12th IEEE Computer Security Foundations Workshop-CSFW’99, pages 72–82, Mordano, Italy, June 1999. IEEE Computer Society Press.
- A. Maneki. Honest functions and their application to the analysis of cryptographic protocols. In P. Syverson, editor, Proceedings of the 12th IEEE Computer Security Foundations Workshop-CSFW’99, pages 83–89, Mordano, Italy, June 1999. IEEE Computer Society Press.
- R.M. Needham and M.D. Schroeder. Using encryption for authentication in large networks of computers. Communications of the ACM, 21(12):993–999, 1978. CrossRef
- Dawn Song. Athena: a new efficient automatic checker for security protocol analysis. In Proceedings of the Twelth IEEE Computer Security Foundations Workshop, pages 192–202, Mordano, Italy, June 1999. IEEE Computer Society Press.
- A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis
- Book Title
- Software Security — Theories and Systems
- Book Subtitle
- Mext-NSF-JSPS International Symposium, ISSS 2002 Tokyo, Japan, November 8–10, 2002 Revised Papers
- Book Part
- Part 10
- pp 356-383
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 4. Keio University
- 5. University of Pennsylvania
- 6. University of Pennsylvania
- 7. Keio University
- 8. University of Tokyo
- Author Affiliations
- 9. Advanced Engineering and Sciences Division, ITT Industries, Inc., 2560 Huntington Avenue, 22303-1410, Alexandria, VA, USA
- 10. Computer Science Department, Stanford University, 94305-9045, Stanford, CA, USA
- 11. Computer Science Laboratory, SRI International, 333 Ravenswood Avenue, Menlo Park, 94025-3493, CA, USA
- 12. Mathematics Department, University of Pennsylvania, 209 South 33rd Street, 19104-6395, Philadelphia, PA, USA
To view the rest of this content please follow the download PDF link above.