Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Cervesato, Ilianoa | Durgin, Nancy A.b | Lincoln, Patrick D.c | Mitchell, John C.d | Scedrov, Andree
Affiliations: [a] Advanced Engineering and Sciences Division, ITT Industries, Inc., Alexandria, VA 22303-1410, USA. E-mail: iliano@itd.nrl.navy.mil | [b] Sandia National Laboratories, Livermore, CA, USA. E-mail: nadurgi@sandia.gov | [c] Computer Science Laboratory, SRI International, Menlo Park, CA 94025-3493, USA. E-mail: lincoln@csl.sri.com | [d] Computer Science Department, Stanford University, Stanford, CA 94305-9045, USA. E-mail: jcm@cs.stanford.edu | [e] Mathematics Department, University of Pennsylvania, Philadelphia, PA 19104-6395, USA. E-mail: scedrov@cis.upenn.edu
Abstract: 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 and multiset rewriting with existential quantification. Strand spaces provide a simple and economical approach to 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 unboundedly many instances of each protocol role, such as client, server, initiator, or responder. A number of modifications to each system are required to produce a meaningful comparison. In particular, we extend the strand formalism with a way of incrementally growing bundles in order to emulate an execution of a protocol with parametric strands. 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.
Keywords: Cryptographic protocols, specification methodologies, strand spaces, multiset rewriting
DOI: 10.3233/JCS-2005-13203
Journal: Journal of Computer Security, vol. 13, no. 2, pp. 265-316, 2005
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl