(Enter summary)
Abstract: We introduce a definition of bisimulation for cryptographic protocols. The definition includes a simple and precise model of the knowledge of the environment with which a protocol interacts. Bisimulation is the basis of an effective proof technique, which yields proofs of classical security properties of protocols and also justifies certain protocol optimizations. The setting for our work is the spi calculus, an extension of the pi calculus with cryptographic primitives. We prove the soundness... (Update)
Cited by: More
Relating Multiset Rewriting and Process - Algebras For Security
(Correct)
Reconciling Two Views of Cryptography - The Computational Soundness
(Correct)
On the Relationships between Notions of.. - Datta, Küsters.. (2006)
(Correct)
Similar documents (at the sentence level):
32.0%: A Bisimulation Method for Cryptographic Protocols - Abadi, Gordon (1998)
(Correct)
Active bibliography (related documents): More All
0.2: A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1998)
(Correct)
0.2: Proof Techniques for Cryptographic Processes - Boreale, De Nicola, Pugliese (1999)
(Correct)
0.1: The Game of the Name in Cryptographic Tables - Amadio, Prasad (1999)
(Correct)
Similar documents based on text: More All
0.2: Towards Automatic Bisimilarity Checking in the Spi Calculus - Elkjćr, Höhle, Nielsen.. (1999)
(Correct)
0.2: Reasoning about Cryptographic Protocols in the Spi Calculus - Abadi, Gordon (1997)
(Correct)
0.1: Secrecy by Typing in Security Protocols - Abadi (1998)
(Correct)
Related documents from co-citation: More All
43: A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997
27: Information and Computation (context) - Milner, Parrow et al. - 1992
26: Proof techniques for cryptographic processes
- Boreale, De Nicola et al. - 1999
BibTeX entry: (Update)
Abadi, M. and Gordon, A. A Bisimulation Method for Cryptographic Protocols, ESOP'98, LNCS 1381, pp. 12-26, 1998. http://citeseer.ist.psu.edu/abadi98bisimulation.html More
@article{ abadi98bisimulation,
author = "Mart{\'\i}n Abadi and Andrew D. Gordon",
title = "A Bisimulation Method for Cryptographic Protocols",
journal = "Lecture Notes in Computer Science",
volume = "1381",
pages = "12--??",
year = "1998",
url = "citeseer.ist.psu.edu/abadi98bisimulation.html" }
Citations (may not include all citations):
854
Information and Computation (context) - Milner, Parrow et al. - 1992
502
Concurrency and automata on infinite sequences (context) - Park - 1981
447
Prentice-Hall International (context) - Milner, Concurrency - 1989
404
A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997
322
Breaking and fixing the Needham-Schroeder public-key protoco..
- Lowe - 1996
276
Applied Cryptography: Protocols (context) - Schneier - 1996
158
Secrecy by typing in security protocols
- Abadi - 1997
143
Proving properties of security protocols by induction
- Paulson - 1997
116
Mathematical Structures in Computer Science (context) - Pierce, Sangiorgi et al. - 1996
106
Observable properties of higher order functions that dynamic..
- Pitts, Stark - 1993
98
Security properties and CSP
- Schneider - 1996
69
Applying formal methods to the analysis of a key management ..
- Meadows - 1992
48
Reasoning about cryptographic protocols in the spi calculus
- Abadi, Gordon - 1997
47
Analyzing encryption protocols using formal verification tec.. (context) - Kemmerer - 1989
33
Using temporal logic to specify and verify cryptographic pro..
- Gray, McLean - 1995
28
National Bureau of Standards
- standard, Inform et al. - 1977
25
A classification of security properties (context) - Focardi, Gorrieri - 1995
24
An approach to the formal verification of cryptographic prot..
- Bolignano - 1996
23
The Interrogator model (context) - Millen - 1995
6
Towards automatic bisimilarity checking in the spi calculus
- Elkjaer, Hohle et al. - 1999
1
A BISIMULATION METHOD FOR CRYPTOGRAPHIC PROTOCOLS (context) - Millen, Clark et al. - 1987
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cryptosoft.com/html/secpub.htm): More
A New Approach for Delegation Using Hierarchical Delegation.. - Ding, Petersen (1995)
(Correct)
A Uniform-Complexity Treatment of Encryption and Zero-Knowledge - Goldreich (1991)
(Correct)
On Signature Schemes With Threshold Verification Detecting.. - Petersen, Michels (1997)
(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