(Enter summary)
Abstract: We develop principles and rules for achieving secrecy properties in
security protocols. Our approach is based on traditional classification
techniques, and extends those techniques to handle concurrent processes
that use shared-key cryptography. The rules have the form of
typing rules for a basic concurrent language with cryptographic primitives,
the spi calculus. They guarantee that, if a protocol typechecks,
then it does not leak its secret inputs. (Update)
Cited by: More
Secure Composition of Insecure Components - Sewell, Vitek (1999)
(Correct)
Computationally Sound Secrecy Proofs by Mechanized Flow Analysis - Backes, Laud (2006)
(Correct)
A Calculus for Cryptographic Protocols - The Spi Calculus - Abadi, Gordon (1998)
(Correct)
Similar documents (at the sentence level):
37.7%: Secrecy by Typing in Security Protocols - Abadi (1997)
(Correct)
Active bibliography (related documents): More All
0.3: Automatic Generation Of Data-Flow Analyzers: A Tool For Building.. - Tjiang (1993)
(Correct)
0.3: Physical Modeling Synthesis Update - Smith, III (2000)
(Correct)
0.3: Security Protocols and their Properties - Abadi (2000)
(Correct)
Similar documents based on text:
98.0: Unknown -
(Correct)
Related documents from co-citation: More All
51: A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997
34: Information and Computation (context) - Milner, Parrow et al. - 1992
33: The SLam calculus: Programming with secrecy and integrity
- Heintze, Riecke - 1998
BibTeX entry: (Update)
M. Abadi. Secrecy by typing in security protocols. In Proceedings of Theoretical Aspects of Computer Software, Third International Symposioum, LNCS 1281, pages 611--638. Springer-Verlag, 1997. http://citeseer.ist.psu.edu/abadi98secrecy.html More
@article{ abadi99secrecy,
author = "Mart{\'\i}n Abadi",
title = "Secrecy by Typing in Security Protocols",
journal = "{Journal of the ACM}",
volume = "46",
number = "5",
pages = "749--786",
year = "1999",
url = "citeseer.ist.psu.edu/abadi98secrecy.html" }
Citations (may not include all citations):
1065
Handbook of Applied Cryptography (context) - Menezes, van Oorschot et al. - 1996 ACM
854
Information and Computation (context) - Milner, Parrow et al. - 1992 DBLP
746
The Java Virtual Machine Specification (context) - Lindholm, Yellin - 1996
566
Proof-carrying code
- Necula - 1997 ACM DBLP
450
Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978 ACM DBLP
410
Mobile ambients
- Cardelli, Gordon - 1998 ACM DBLP
404
A calculus for cryptographic protocols: The spi calculus
- Abadi, Gordon - 1997 DBLP
302
A logic of authentication
- Burrows, Abadi et al. - 1989 ACM DBLP
276
Applied Cryptography: Protocols (context) - Schneier - 1996
263
The inductive approach to verifying cryptographic protocols
- Paulson - 1998 ACM DBLP
244
Cryptography and Data Security (context) - Denning - 1982 ACM DBLP
201
to typed assembly language (context) - Morrisett, Walker et al. - 1998
171
Prudent engineering practice for cryptographic protocols
- Abadi, Needham - 1996 ACM DBLP
149
Testing equivalences for processes (context) - De Nicola, Hennessy - 1984 DBLP
139
Secure information flow in a multithreaded imperative langua..
- Smith, Volpano - 1998
130
Provably secure session key distribution: The three party ca..
- Bellare, Rogaway - 1995 DBLP
116
A typed language for distributed mobile processes
- Riely, Hennessy - 1998
116
Mathematical Structures in Computer Science (context) - Pierce, Sangiorgi et al. - 1996
114
A probabilistic poly-time framework for protocol analysis
- Lincoln, Mitchell et al. - 1998 ACM DBLP
108
Linearity and the pi-calculus
- Kobayashi, Pierce et al. - 1996 ACM DBLP
102
Robustness principles for public key protocols
- Anderson, Needham - 1995 ACM DBLP
102
The SLam calculus: Programming with secrecy and integrity
- Heintze, Riecke - 1998 DBLP
59
A bisimulation method for cryptographic protocols
- Abadi, Gordon - 1998 ACM DBLP
55
A decentralized model for information flow control
- Myers, Liskov - 1997 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
46
Secure implementation of channel abstractions
- Abadi, Fournet et al. - 1998 ACM DBLP
43
The compositional security checker: A tool for the verificat..
- Focardi, Gorrieri - 1997 ACM DBLP
29
Protection in programming-language translations
- Abadi - 1998 ACM DBLP
28
National Bureau of Standards
- standard, Inform et al. - 1977
25
A classification of security properties (context) - Focardi, Gorrieri - 1995 ACM
24
Control flow analysis for the #-calculus (context) - Bodei, Degano et al. - 1998
15
Proving trust in systems of second-order processes (context) - Dam - 1998
13
Limitations on design principles for public key protocols
- Syverson - 1996 ACM
11
Undergraduate lecture notes (context) - Milner, -calculus - 1995
9
Journal of Functional Programming (context) - rbk, Palsberg et al. - 1997
6
Strategies against replay attacks
- Aura - 1997 ACM DBLP
6
Van Nostrand Reinhold Company Inc (context) - Gasser, Computer - 1988
3
Private communication (context) - Gay - 1997
3
Private communication (context) - Milner, Pierce - 1997
1
Appeared in Logic and Algebra of Specification (context) - Milner, -calculus et al. - 1993
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://research.microsoft.com/~adg/Teaching/spi-course.html):
A Calculus for Cryptographic Protocols - Lecture Notes Andrew
(Correct)
Authenticity by Typing for Security Protocols - Andrew Gordon Microsoft (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