See this document in CiteSeerX!

A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis (2002)  (Make Corrections)  (4 citations)
Iliano Cervesato, Nancy A. Durgin, Patrick D. Lincoln, et al.



  Home/Search   Context   Related

Links:   DBLP

 
View or download:
stanford.edu/~iliano/pap...jcs05b.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  stanford.edu/~iliano/papers/ (more)
(Enter author homepages)

Rate this article: (best)
View Comments (0)
(Enter summary)

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... (Update)

Cited by:   More
A Comparison between Strand Spaces and Multiset.. - Cervesato, Durgin.. (2002)   (Correct)
Formal Analysis of Kerberos 5 - Frederick Butler Iliano   (Correct)
Contract Signing, Optimism, and Advantage - Rohit Chadha John   (Correct)

Similar documents (at the sentence level):
20.8%:   Relating Strands and Multiset Rewriting for Security Protocol .. - Cervesato, al. (2000)   (Correct)
13.0%:   Relating Strands and Multiset Rewriting for.. - Cervesato.. (2000)   (Correct)
5.2%:   Interpreting Strands in Linear Logic - Cervesato, Durgin, Kanovich.. (2000)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Representing the MSR Cryptoprotocol Specification Language.. - Cervesato, Stehr (2005)   (Correct)
0.4:   Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006)   (Correct)
0.3:   The Logical Meeting Point of Multiset Rewriting and Process.. - Cervesato (2004)   (Correct)

Similar documents based on text:
2.0:   Unknown -   (Correct)

Related documents from co-citation:   More   All
3:   Multiset Rewriting and the Complexity of Bounded Security Protocols - Durgin, Lincoln et al. - 2002
3:   A calculus for cryptographic protocols: The spi calculus - Abadi, Gordon - 1997
3:   A meta-notation for protocol analysis - Cervesato, Durgin et al. - 1999

BibTeX entry:   (Update)

I. Cervesato, N. Durgin, P.D. Lincoln, J.C. Mitchell, and A. Scedrov. A comparison between strand spaces and multiset rewriting for security protocol analysis. In M. Okada et al., eds., "Software Security { Theories and Systems. Mext-NSF-JSPS International Symposium, ISSS 2002. http://citeseer.ist.psu.edu/cervesato02comparison.html   More

@misc{ cervesato02comparison,
  author = "I. Cervesato and N. Durgin and P. Lincoln and J. Mitchell and A. Scedrov",
  title = "A comparison between strand spaces and multiset rewriting for security
    protocol analysis",
  text = "I. Cervesato, N. Durgin, P.D. Lincoln, J.C. Mitchell, and A. Scedrov. A
    comparison between strand spaces and multiset rewriting for security protocol
    analysis. In M. Okada et al., eds., Software Security { Theories and Systems.
    Mext-NSF-JSPS International Symposium, ISSS 2002.",
  year = "2002",
  url = "citeseer.ist.psu.edu/cervesato02comparison.html" }
Citations (may not include all citations):
450   Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978  ACM   DBLP
404   A calculus for cryptographic protocols: the spi calculus - Abadi, Gordon - 1999
317   IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
254   Theoretical Computer Science (context) - Berry, Boudol et al. - 1992
143   Proving properties of security protocols by induction - Paulson - 1997
104   A meta-notation for protocol analysis - Cervesato, Durgin et al. - 1999  ACM   DBLP
90   Strand spaces: Why is a security protocol correct (context) - Fabrega, Herzog et al. - 1998
47   Constraint solving for bounded-process cryptographic protoco.. - Millen, Shmatikov - 2001  ACM   DBLP
42   CAPSL Intermediate Language - Denker, Millen - 1999
31   Athena: a new efficient automatic checker for security proto.. - Song - 1999  DBLP
30   Typed MSR: Syntax and Examples - Cervesato - 2001
28   The faithfulness of abstract protocol analysis: message auth.. (context) - Guttman, Fabrega et al. - 2001  DBLP
27   Events in security protocols - Crazzolara, Winskel - 2001
24   A compositional logic for protocol correctness - Durgin, Mitchell et al. - 2001  ACM   DBLP
20   Interpreting Strands in Linear Logic - Cervesato, Durgin et al. - 2000
20   Theoretical Computer Science (context) - Guttman, Fabrega et al. - 2002  ACM
17   Models for concurrency: Towards a classification - Sassone, Nielsen et al. - 1996
12   CAPSL interface for the NRL protocol analyzer - Brackin, Meadows et al. - 1999
9   Multiset rewriting and the complexity of bounded security pr.. - Durgin, Lincoln et al. - 2004  ACM
8   Honest functions and their application to the analysis of cr.. (context) - Maneki - 1999
6   Petri nets and algebraic calculi of processes (context) - Boudol, Roucairol et al. - 1985
6   the relationship between strand spaces and multi-agent syste.. (context) - Halpern, Pucella - 2001
5   Strand spaces and rank functions: More than distant cousins (context) - Heather - 2002  DBLP
5   Towards a strand semantics for authentication logic - Syverson - 2000  DBLP
5   A CAPSL connector to Athena (context) - Millen - 2000
5   Design of a CIL connector to Maude - Denker - 2000
4   Invariant generation techniques in cryptographic protocol an.. - Meadows - 2000  ACM   DBLP
4   A Comparison between Strand Spaces and Multiset Rewriting fo.. - Cervesato, Durgin et al. - 2003
4   A Petri net semantics for pi-calculus - Busi, Gorrieri - 1995
4   Multisets and structural congruence of the #-calculus with r.. (context) - Engelfriet, Gelsema - 1999
4   Encryption as an abstract data-type: An extended abstract - Miller - 2003
2   Milner's communicating systems and Petri nets (context) - de Cindio, de Michelis et al. - 1982

Documents on the same site (http://theory.stanford.edu/~iliano/papers/):   More
Cryptographically Sound Security Proofs for - Basic And Public-Key   (Correct)
The Logical Meeting Point of Multiset Rewriting and Process.. - Cervesato (2004)   (Correct)
Towards a Notion of Quantitative Security Analysis - Cervesato   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC