(Enter summary)
Abstract: We study the verication of secrecy and authenticity properties for cryptographic protocols which rely on symmetric shared keys. The verification can be reduced to check whether a certain parallel program which models the protocol and the specification can reach an erroneous state while interacting with the environment. Assuming finite principals, we present a simple decision procedure for the reachability problem which is based on a `symbolic' reduction system. (Update)
Cited by: More
Searching for Shapes in Cryptographic Protocols - Doghmi, Guttman, Thayer
(Correct)
Basic Research in Computer Science - Recursion Vs Replication
(Correct)
A Method for Symbolic Analysis of Security Protocols - Boreale, Buscemi
(Correct)
Active bibliography (related documents): More All
1.1: The Game of the Name in Cryptographic Tables - Amadio, Prasad (1999)
(Correct)
0.4: Symbolic Trace Analysis of Cryptographic Protocols - Boreale
(Correct)
0.2: Symbolic Analysis of Cryptographic Protocols in the Spi-Calculus - Boreale (2000)
(Correct)
Similar documents based on text: More All
0.6: On the Reachability Problem in Cryptographic Protocols - Amadio, Lugiez (2000)
(Correct)
0.4: Optimization of GEO Satellite Links Deployment in the Internet - Filali, Dabbous (2000)
(Correct)
0.3: On Name Generation and Set-Based Analysis in the Dolev-Yao.. - Amadio, Charatonik (2002)
(Correct)
Related documents from co-citation: More All
33: Undecidability of bounded security protocols
- Durgin, Lincoln et al. - 1999
26: A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997
25: Constraint solving for boundedprocess cryptographic protocol analysis
- Millen, Shmatikov
BibTeX entry: (Update)
Roberto M. Amadio and Denis Lugiez. On the reachability problem in cryptographic protocols. In Catuscia Palamidessi, editor, CONCUR 2000: Concurrency Theory (11th International Conference), volume 1877 of Lecture Notes in Computer Science, pages 380-394. Springer-Verlag, August 2000. http://citeseer.ist.psu.edu/article/amadio00reachability.html More
@article{ amadio00reachability,
author = "Roberto M. Amadio and Denis Lugiez",
title = "On the Reachability Problem in Cryptographic Protocols",
journal = "Lecture Notes in Computer Science",
volume = "1877",
pages = "380+",
year = "2000",
url = "citeseer.ist.psu.edu/article/amadio00reachability.html" }
Citations (may not include all citations):
404
A calculus for cryptographic protocols: the spi calculus
- Abadi, Gordon - 1997 DBLP
184
Automated analysis of cryptographic protocols using murOE
- Mitchell, Mitchell et al. - 1997
143
Proving properties of security protocols by induction
- Paulson - 1997
98
Security properties and CSP
- Schneider - 1996 ACM
62
Breaking and xing the Needham-Schroeder public-key protocol ..
- Lowe - 1996
54
Using state space exploration and a natural deduction style ..
- Clarke, Jha et al. - 1998 ACM DBLP
50
A survey of authentication protocol literature: Version
- Clark, Jacob - 1997
44
Proof techniques for cryptographic processes
- Boreale, De Nicola et al. - 1999 ACM DBLP
34
Abstracting cryptographic protocols with tree automata
- Monniaux - 1999
24
A model of computation for the nrl protocol analyzer
- Meadows - 1994
11
Proving security protocols correct (context) - Paulson - 1999
6
Symbolic analysis of cryptographic protocols in the spi-calc..
- Boreale - 2000
6
The game of the name in cryptographic tables
- Amadio, Prasad - 1999 ACM DBLP
2
EOEcient innite-state analysis of security protocols (context) - Huima - 1999
2
Formal verication of cryptographic protocols (context) - Bolignano - 1996
1
Draft available at http://www (context) - Comon, Dauchet et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://protis.univ-mrs.fr/~amadio/papers.html):
The Receptive Distributed π-Calculus (Extended Abstract) - Amadio, Boudol, al.
(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