I. Cervesato, et al.  Home/Search
Context Related
| upenn.edu/pub/papers...csfw00rev.ps.gz stanford.edu/pub/jcm/papers...csfw00.ps stanford.edu/~iliano...csfw00rev.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~scedro...recent_papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: y I. Cervesato ITT Industries iliano@itd.nrl.navy.mil N. Durgin, J. Mitchell Stanford University fnad, jcmg@cs.stanford.edu P. Lincoln SRI International lincoln@csl.sri.com A. Scedrov U. of Pennsylvania 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 [6] and multiset rewriting with... (Update)
Cited by: More
Relating Multiset Rewriting and Process - Algebras For Security (Correct)
Electronic Notes in Theoretical Computer Science 40 (2001) - Url Http Www (Correct)
Representing the MSR Cryptoprotocol Specification Language.. - Cervesato, Stehr (2005) (Correct)
Similar documents (at the sentence level):
56.6%: A Comparison between Strand Spaces and Multiset.. - Cervesato.. (2002) (Correct)
51.6%: Relating Strands and Multiset Rewriting for.. - Cervesato.. (2000) (Correct)
10.2%: Interpreting Strands in Linear Logic - Cervesato, Durgin, Kanovich.. (2000) (Correct)
Active bibliography (related documents): More All
0.2: The Logic of Authentication Protocols - Syverson, Cervesato (2001) (Correct)
0.1: Strand Spaces: Proving Security Protocols Correct - Fabrega, Herzog, Guttman (1999) (Correct)
0.0: Open Issues in Formal Methods for Cryptographic Protocol Analysis - Meadows (2000) (Correct)
Similar documents based on text: More All
0.5: Computational Soundness of Formal Adversaries - Herzog (2002) (Correct)
0.5: Multiset Rewriting and the Complexity of Bounded.. - Durgin, Lincoln.. (2002) (Correct)
0.4: Ensuring Security through Model Checking in a Logical Environment - Bozzano (2001) (Correct)
Related documents from co-citation: More All
25: A meta-notation for protocol analysis - Cervesato, Durgin et al. - 1999
25: IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
19: The NRL Protocol Analyzer: An overview - Meadows - 1996
BibTeX entry: (Update)
Iliano Cervesato, Nancy Durgin, Patrick Lincoln, John Mitchell, and Andre Scedrov. Relating strands and multiset rewriting for security protocol analysis. In Paul Syverson, editor, Proc. 13th IEEE Computer Security Foundations Workshop (CSFW), pages 35-51. IEEE Computer Society Press, July 2000. http://citeseer.ist.psu.edu/cervesato00relating.html More
@inproceedings{ cervesato00relating,
author = "Cervesato and Durgin and Mitchell and Lincoln and Scedrov",
title = "Relating Strands and Multiset Rewriting for Security Protocol Analysis",
booktitle = "{PCSFW}: Proceedings of The 13th Computer Security Foundations Workshop",
publisher = "IEEE Computer Society Press",
year = "2000",
url = "citeseer.ist.psu.edu/cervesato00relating.html" }
Citations (may not include all citations):450 Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978 ACM DBLP
317 IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
104 A meta-notation for protocol analysis - Cervesato, Durgin et al. - 1999 ACM DBLP
90 Strand spaces: Why is a security protocol correct (context) - Thayer, Jonathan et al. - 1998
71 Undecidability of bounded security protocols - Durgin, Lincoln et al. - 1999
42 CAPSL Intermediate Language - Denker, Millen - 1999
25 Mixed strand spaces (context) - Thayer, Jonathan et al. - 1999 ACM DBLP
8 Honest functions and their application to the analysis of cr.. (context) - Maneki - 1999 ACM DBLP
5 A comparison between strand spaces and transition systems fo.. (context) - Cervesato, Durgin et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cis.upenn.edu/~scedrov/recent_papers.html): More
The Undecidability of Second Order Multiplicative Linear Logic - Yves Lafont (1996) (Correct)
Phase Semantics for Light Linear Logic - Kanovich, Okada, Scedrov (1997) (Correct)
Optimization Complexity of Linear Logic Proof Games - Lincoln, Mitchell, Scedrov (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