(Enter summary)
Abstract: We introduce the spi calculus, an extension of the pi calculus designed for
describing and analyzing cryptographic protocols. We show how to use
the spi calculus, particularly for studying authentication protocols. The pi
calculus (without extension) suffices for some abstract protocols; the spi
calculus enables us to consider cryptographic issues in more detail. We
represent protocols as processes in the spi calculus and state their security
properties in terms of coarse-grained notions of... (Update)
Cited by: More
A Comparison between Strand Spaces and Multiset.. - Cervesato, Durgin.. (2002)
(Correct)
Manifest Security for Distributed Information - Crary, Harper, Pfenning (2006)
(Correct)
A Concurrent Logical Framework II: - Examples And Applications
(Correct)
Similar documents (at the sentence level):
25.3%: A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1997)
(Correct)
Active bibliography (related documents): More All
0.3: Reasoning about Cryptographic Protocols in the Spi Calculus - Abadi, Gordon (1997)
(Correct)
0.2: A Bisimulation Method for Cryptographic Protocols - Abadi, Gordon (1998)
(Correct)
0.2: Secrecy by Typing in Security Protocols - Abadi (1998)
(Correct)
Similar documents based on text:
97.0: Unknown -
(Correct)
Related documents from co-citation: More All
42: Information and Computation (context) - Milner, Parrow et al. - 1992
30: Mobile ambients
- Cardelli, Gordon - 1998
26: Breaking and fixing the Needham-Schroeder public-key protocol using FDR
- Lowe - 1996
BibTeX entry: (Update)
M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, pages 36--47, 1997. http://citeseer.ist.psu.edu/abadi98calculus.html More
@inproceedings{ abadi97calculus,
author = "Mart{\'\i}n Abadi and Andrew D. Gordon",
title = "A Calculus for Cryptographic Protocols: The Spi Calculus",
booktitle = "Fourth {ACM} Conference on Computer and Communications Security",
publisher = "{ACM} Press",
pages = "36--47",
year = "1997",
url = "citeseer.ist.psu.edu/abadi98calculus.html" }
Citations (may not include all citations):
2732
Communicating Sequential Processes (context) - Hoare - 1985 ACM DBLP
1529
A method for obtaining digital signatures and public-key cry..
- Rivest, Shamir et al. - 1978 ACM DBLP
854
Information and Computation (context) - Milner, Parrow et al. - 1992 DBLP
450
Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978 ACM DBLP
447
Prentice-Hall International (context) - Milner, Concurrency - 1989
428
IEEE Transactions on Information Theory (context) - Diffie, Hellman et al. - 1976
404
A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997 DBLP
404
A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997 DBLP
322
Breaking and fixing the Needham-Schroeder public-key protoco..
- Lowe - 1996 ACM DBLP
302
A logic of authentication
- Burrows, Abadi et al. - 1989 ACM DBLP
276
Applied Cryptography: Protocols (context) - Schneier - 1996
254
Theoretical Computer Science (context) - Berry, Boudol et al. - 1992 ACM
253
Authentication in distributed systems: Theory and practice
- Lampson, Abadi et al. - 1992 DBLP
197
Barbed bisimulation
- Milner, Sangiorgi - 1992 ACM DBLP
171
Prudent engineering practice for cryptographic protocols
- Abadi, Needham - 1996 ACM DBLP
162
A calculus for access control in distributed systems
- Abadi, Burrows et al. - 1993 ACM DBLP
158
Secrecy by typing in security protocols
- Abadi - 1997 ACM
149
Testing equivalences for processes (context) - De Nicola, Hennessy - 1984 DBLP
143
Proving properties of security protocols by induction
- Paulson - 1997
130
Provably secure session key distribution: The three party ca..
- Bellare, Rogaway - 1995 DBLP
116
Mathematical Structures in Computer Science (context) - Pierce, Sangiorgi et al. - 1996
112
Bisimilarity as a theory of functional programming (context) - Gordon - 1995 ACM DBLP
98
Security properties and CSP
- Schneider - 1996
97
the security of public key protocols (context) - Dolev, Yao - 1981
97
Mathematical Structures in Computer Science (context) - Milner, processes - 1992
89
The Interrogator: Protocol security analysis (context) - Millen, Clark et al. - 1987 ACM DBLP
69
Applying formal methods to the analysis of a key management ..
- Meadows - 1992 DBLP
59
A bisimulation method for cryptographic protocols
- Abadi, Gordon - 1998 ACM DBLP
54
Testing equivalence for mobile processes (context) - Boreale, De Nicola - 1995 ACM DBLP
48
Reasoning about cryptographic protocols in the spi calculus
- Abadi, Gordon - 1997 ACM DBLP
47
Analyzing encryption protocols using formal verification tec.. (context) - Kemmerer - 1989 DBLP
33
Using temporal logic to specify and verify cryptographic pro..
- Gray, McLean - 1995 ACM DBLP
28
National Bureau of Standards
- standard, Inform et al. - 1977
25
Authentication in distributed systems: A bibliography (context) - Liebl - 1993 DBLP
23
The Interrogator model (context) - Millen - 1995 ACM
11
Undergraduate lecture notes (context) - Milner, -calculus - 1995
7
Laboratory for Foundations of Computer Science (context) - Sangiorgi, bisimulation et al. - 1994
6
On two proposals for on-line bankcard payments using open ne..
- Mao - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://research.microsoft.com/~adg/Publications/details.htm): More
Stack Inspection: Theory and Variants - Fournet, Gordon (2001)
(Correct)
Stack Inspection: Theory and Variants - Fournet, Gordon
(Correct)
Typing Correspondence Assertions for Communication Protocols - Gordon, Jeffrey (2001)
(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