(Enter summary)
Abstract: The Gurevich's Abstract State Machine formalism is used to specify the well known Kerberos Authentication System based on the Needham-Schroeder authentication protocol. A complete model of the system is reached through stepwise refinements of ASMs, and is used as a basis both to discover the minimum assumptions to guarantee the correctness of the system and to analyse its security weaknesses. Each refined model comes together with a correctness refinement theorem. (Update)
Cited by: More
Verifying Confidentiality and Authentication in - Kerberos Frederick Butler
(Correct)
A Formal Analysis of Some Properties of Kerberos 5 Using MSR - Frederick Butlery Iliano
(Correct)
Inductive Verification of Cryptographic Protocols - Bella (2000)
(Correct)
Active bibliography (related documents): More All
0.1: A Programmer Friendly Modular Definition of the Semantics of.. - Börger, Schulte (1997)
(Correct)
0.1: Automated Theorem Proving In High-Quality Software Design - Schumann
(Correct)
0.1: Decision Procedures for the Analysis of Cryptographic Protocols.. - Monniaux (1999)
(Correct)
Similar documents based on text: More All
0.6: ASM-based Testing: Coverage Criteria and Automatic Test.. - Gargantini, Riccobene (2001)
(Correct)
Related documents from co-citation: More All
15: The kerberos network authentication service
- Kohl, Neuman - 1993
10: Using Isabelle to prove properties of the Kerberos authentication system
- Bella, Paulson - 1997
9: Automated analysis of cryptographic protocols using MurOE
- Mitchell, Mitchell et al. - 1997
BibTeX entry: (Update)
Bella, G., Riccobene, E.: Formal Analysis of the Kerberos Authentication System. Journal of Universal Computer Science: Special Issue on Gurevich's Abstract State Machine 3(12) (1997) 1337--1381 http://citeseer.ist.psu.edu/bella97formal.html More
@article{ bella97formal,
author = "G. Bella and E. Riccobene",
title = "Formal Analysis of the {Kerberos} Authentication System",
journal = "J.UCS: Journal of Universal Computer Science",
volume = "3",
number = "12",
pages = "1337+",
year = "1997",
url = "citeseer.ist.psu.edu/bella97formal.html" }
Citations (may not include all citations):
450
Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978
373
UNIX Network Programming (context) - Stevens - 1990
322
Breaking and fixing the Needham-Schroeder public-key protoco..
- Lowe - 1996
302
A Logic for Authentication
- Burrows, Abadi et al. - 1990
184
Automated Analysis of Cryptographic Protocols Using Murphi
- Mitchell, Mitchell et al. - 1997
178
Kerberos: An authentication service for computer network (context) - Neuman, Ts'o - 1994
176
Timestamps in key distribution protocols (context) - Denning, Sacco - 1981
171
Prudent engineering practice for cryptographic protocols
- Abadi, Needham - 1996
143
Proving properties of security protocols by induction
- Paulson - 1996
130
Provably Secure Session Key Distribution -- The Three Party ..
- Bellare, Rogaway - 1995
128
Why cryptosystems fail
- Anderson - 1994
94
Security mechanisms in high-level network protocols (context) - Voydock, Kent - 1983
79
Limitations of the Kerberos authentication system
- Bellovin, Merritt - 1990
33
Using Isabelle to Prove Properties of the Kerberos Authentic..
- Bella, Paulson - 1997
24
An approach to the formal verification of cryptographic prot..
- Bolignano - 1996
19
Why Use Evolving Algebras for Hardware and Software Engineer..
- Borger - 1995
15
Specification and Validation Methods (context) - Borger - 1994
8
Network and Internetwork Security Principles and Practice (context) - Stalling - 1995
8
Integrating ASMs into the Software Development Life Cycle
- Borger, Mearelli - 1997
8
Automatic Verification of Cryptographic Protocols with Sethe.. (context) - Schumann - 1997
1
Kerberos Authentication and Authorisation System (context) - Miller, Neuman et al. - 1989
1
SPLICEnAS: A case study in using to detect errors in securit.. (context) - Lowe - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://linux.eecs.umich.edu/.5/groups/Ealgebras/): More
The Mathematics of Set Predicates in Prolog - Börger (1993)
(Correct)
Initialization Problems for Java - Börger, Schulte (1999)
(Correct)
The Semantics of the C Programming Language - Gurevich, Huggins (1993)
(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