(Enter summary)
Abstract: We formalize the Dolev-Yao model of security protocols, using a notation
based on multi-set rewriting with existentials. The goals are to provide a simple
formal notation for describing security protocols, to formalize the assumptions
of the Dolev-Yao model using this notation, and to analyze the complexity
of the secrecy problem under various restrictions. We prove that, even for the
case where we restrict the size of messages and the depth of message encryption,
the secrecy problem is... (Update)
Cited by: More
Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006)
(Correct)
Verifying Confidentiality and Authentication in - Kerberos Frederick Butler
(Correct)
A Comparison between Strand Spaces and Multiset.. - Cervesato, Durgin.. (2002)
(Correct)
Similar documents (at the sentence level):
8.0%: Undecidability of Bounded Security Protocols - Mitchell (1999)
(Correct)
5.0%: A Meta-notation for Protocol Analysis - Cervesato, Durgin, Lincoln.. (1999)
(Correct)
Active bibliography (related documents): More All
3.4: Multiset Rewriting and the Complexity of Bounded.. - Durgin, Lincoln.. (2002)
(Correct)
0.4: Analysis of Security Protocols - Durgin, MITCHELL (1999)
(Correct)
0.4: Interpreting Strands in Linear Logic - Cervesato, Durgin, Kanovich.. (2000)
(Correct)
Similar documents based on text:
0.1: The Impossibility of Realizable Ideal Functionality - Datta, Derek, Mitchell.. (2005)
(Correct)
Related documents from co-citation: More All
7: The kerberos network authentication service
- Kohl, Neuman - 1993
6: The Kerberos Network Authentication Service (context) - Neuman, Yu et al. - 2004
5: Using Isabelle to prove properties of the Kerberos authentication system
- Bella, Paulson - 1997
BibTeX entry: (Update)
N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov, Multiset Rewriting and the Complexity of Bounded Security Protocols, (2002), Manuscript, 63 pages. http://citeseer.ist.psu.edu/durgin03multiset.html More
@misc{ durgin02multiset,
author = "N. Durgin and P. Lincoln and J. Mitchell and A. Scedrov",
title = "Multiset Rewriting and the Complexity of Bounded Security Protocols",
text = "N. A. Durgin, P. D. Lincoln, J. C. Mitchell, and A. Scedrov, Multiset Rewriting
and the Complexity of Bounded Security Protocols, (2002), Manuscript, 63
pages.",
year = "2002",
url = "citeseer.ist.psu.edu/durgin03multiset.html" }
Citations (may not include all citations):
982
Theoretical Computer Science (context) - Girard - 1987 ACM
982
Theoretical Computer Science (context) - Girard - 1987 ACM
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 DBLP
370
A Mathematical Introduction to Logic (context) - Enderton - 1972
317
IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
302
A logic of authentication
- Burrows, Abadi et al. - 1990 ACM DBLP
245
Relational queries computable in polynomial time
- Immerman - 1986 ACM DBLP
229
Foundations for Programming Languages (context) - Mitchell - 1996
184
Automated analysis of cryptographic protocols using Mur
- Mitchell, Mitchell et al. - 1997
159
The Chemical Abstract Machine (context) - Berry, Boudol - 1990
143
Proving properties of security protocols by induction
- Paulson - 1997 ACM DBLP
136
The Kerberos network authentication service
- Kohl, Neuman - 1993
121
Three systems for cryptographic protocol analysis (context) - Kemmerer, Meadows et al. - 1994
104
A metanotation for protocol analysis
- Cervesato, Durgin et al. - 1999
99
Modelling and verifying key-exchange protocols using CSP and..
- Roscoe - 1995
98
Security properties and CSP
- Schneider ACM
90
A linear logical framework
- Cervesato, Pfenning - 1996 ACM DBLP
90
Strand spaces: Why is a security protocol correct (context) - Thayer, abrega et al. - 1998
75
Complexity and expressive power of logic programming
- Dantsin, Eiter et al. - 1997 ACM DBLP
71
Undecidability of bounded security protocols
- Durgin, Lincoln et al. - 1999
62
Breaking and xing the Needham-Schroeder public-key protocol ..
- Lowe - 1996
55
Analyzing the Needham-Schroeder public-key protocol: a compa..
- Meadows - 1996 DBLP
54
Using state space exploration and a natural deduction style ..
- Clarke, Jha et al. - 1998 ACM DBLP
50
the reachability problem in cryptographic protocols
- Amadio, Lugiez - 2000
48
Mechanized proofs for a recursive authentication protocol
- Paulson - 1997
45
Decision problems for semi-thue systems with a few rules
- Matiyasevich, Senizergues - 1996 ACM DBLP
44
A survey of authentication protocol literature (context) - Clark, Jacob - 1997
42
Capsl intermediate language
- Denker, Millen - 1999
37
A model for secure protocols and their compositions
- Heintze, Tygar - 1994 ACM DBLP
37
the security of multi-party ping{pong protocols
- Even, Goldreich - 1983
35
Normal process representatives (context) - Gehlot, Gunther - 1990 DBLP
35
Normal process representatives (context) - Gehlot, Gunter - 1990 DBLP
35
From Petri nets to linear logic (context) - Mart, Meseguer - 1989
33
From Petri nets to linear logic (context) - Marti-Oliet, Meseguer - 1991 ACM DBLP
32
Automatic recognition of tractability in inference relations
- McAllester - 1993 ACM DBLP
32
Petri nets and linear logic: a case study for logic programm..
- Cervesato - 1995
31
The evolution of the Kerberos authentication service
- Kohl, Neuman et al. - 1994
30
Typed MSR: Syntax and examples
- Cervesato - 2052 DBLP
28
Inductive methods and contract-signing protocols
- Scedrov, Chadha et al. - 2001 ACM DBLP
25
Protocol speci cation and analysis in Maude (context) - Denker, Meseguer et al. - 1998
20
Interpreting strands in linear logic
- Cervesato, Durgin et al. - 2000
19
the symbolic reduction of processes with cryptographic funct.. (context) - Amadio, Lugiez et al. - 2002
19
Embedded implicational dependencies and their inference prob.. (context) - Chandra, Lewis et al. - 1981 ACM DBLP
19
Linear logic as a logic of computation (context) - Kanovich - 1994
12
A formal analysis of some properties of Kerberos 5 using MSR
- Butler, Cervesato et al. - 2002 ACM DBLP
12
draft-ietf-tls-ssl-version (context) - Freier, Karlton et al. - 1996
12
Protocol insecurity with nite number of sessions is np-compl.. (context) - Rusinowitch, Turuani - 2001
8
A speci cation language for crypto-protocols based on multis.. (context) - Cervesato - 2001
7
Analysis of security protocols
- Durgin, Mitchell - 1999
7
Ecient in nite-state analysis of security protocols (context) - Huima - 1999
6
Bulletion of the American Mathematical Society (context) - Post, of et al. - 1946
6
Specifying real-time nite-state systems in linear logic (context) - Kanovich, Okada et al. - 1998
6
Analysis of security protocols (context) - Mitchell - 1998
6
Taps: A rst-order veri er for cryptographic protocols (context) - Cohen - 2000
5
UCLA Computer Science Department (context) - Goguen, algebra et al. - 1978
5
Department of Computer Science (context) - Asperti, for et al. - 1987
5
The Dolev-Yao intruder is the most powerful attacker
- Cervesato - 2001
5
Proving authentication protocols in a fragment of linear log.. (context) - Compton, Dexter - 1998
4
Term rewriting: a tutorial (context) - Klop - 1987
3
Computing by multiset transformation (context) - Ban, Le and et al. - 1993
Documents on the same site (http://theory.stanford.edu/people/jcm/publications.htm): More
A Core Calculus of Classes and Mixins - Bono, Patel, Shmatikov (1999)
(Correct)
Analysis of a Fair Exchange Protocol - Shmatikov, Mitchell (1999)
(Correct)
Relating Strands and Multiset Rewriting for.. - Cervesato.. (2000)
(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