(Enter summary)
Abstract: . The version of Kerberos presented by Burrows et al. [5] is
fully mechanised using the Inductive Method. Two models are presented,
allowing respectively the leak of any session keys, and of expired session
keys. Thanks to timestamping, the protocol provides the involved parties
with strong guarantees in a realistically hostile environment. These
guarantees are supported by the generic theorem prover Isabelle.
1 Introduction
Although pioneered two decades ago [10], he use of formal methods in... (Update)
Context of citations to this paper: More
...of evidence and fairness. We were pleased to observe that these strategies di#er little from those for proving authentication goals [5, 6], and that the approach required no extensions. Our proofs were conducted on a popular non repudiation protocol due to Zhou and Gollmann...
.... Publications Some of the work presented in this dissertation has been published, and may be found in references [11, 12, 13, 15, 17, 18, 19, 20]. For comments or suggestions, email Giampaolo.Bella cl.cam.ac.uk This dissertation is copyright c 2000 by G. Bella. iii...
Cited by: More
Verifying Confidentiality and Authentication in - Kerberos Frederick Butler
(Correct)
Inductive Verification of Cryptographic Protocols - Bella (2000)
(Correct)
A Verification Environment for I/O Automata - Müller (1998)
(Correct)
Similar documents (at the sentence level):
68.8%: Mechanising BAN Kerberos by the Inductive Method - Bella, Paulson (1998)
(Correct)
Active bibliography (related documents): More All
0.3: Kerberos Version IV: Inductive Analysis of the Secrecy Goals - Bella, Paulson (1998)
(Correct)
0.1: Using Isabelle to Prove Properties of the Kerberos.. - Bella, Paulson (1997)
(Correct)
0.1: Automatic Covert Channel Analysis of a - Multilevel Secure Component
(Correct)
Similar documents based on text: More All
0.4: Verifying the SET registration protocols - Bella, Massacci, Paulson (2002)
(Correct)
Related documents from co-citation: More All
6: A Logic of Authentication
- Burrows, Abadi et al. - 1990
6: The NRL Protocol Analyzer: An overview
- Meadows - 1996
6: Proving properties of security protocols by induction
- Paulson - 1997
BibTeX entry: (Update)
Bella, G., Paulson, L. C.: Mechanising BAN Kerberos by the Inductive Method. Proc. of Conference on Computer Aided Verification. Springer (1998) (to appear) http://citeseer.ist.psu.edu/article/bella98mechanising.html More
@inproceedings{ bella98mechanising,
author = "Giampaolo Bella and Lawrence C. Paulson",
title = "Mechanising {BAN} Kerberos by the Inductive Method",
booktitle = "Computer Aided Verification",
pages = "416-427",
year = "1998",
url = "citeseer.ist.psu.edu/article/bella98mechanising.html" }
Citations (may not include all citations):
450
Using encryption for authentication in large networks of com.. (context) - Needham, Schroeder - 1978
322
Breaking and Fixing the Needham-Schroeder Public-Key Protoco..
- Lowe - 1996
302
A logic of authentication
- Burrows, Abadi et al. - 1989
294
Isabelle: A Generic Theorem Prover (context) - Paulson - 1994
143
Proving properties of security protocols by induction
- Paulson - 1997
134
The NRL Protocol Analyzer: An Overview
- Meadows - 1996
110
Casper: a Compiler for the Analysis of Security Protocols
- Lowe - 1996
79
Limitations of the Kerberos authentication system
- Bellovin, Merritt - 1990
48
Mechanized proofs for a recursive authentication protocol
- Paulson - 1997
33
Using Isabelle to Prove Properties of the Kerberos Authentic..
- Bella, Paulson - 1997
30
Towards a Mechanization of Cryptographic Protocol Verificati..
- Bolignano - 1997
23
A HOL Extension of GNY for Automatically Analyzing Cryptogra..
- Brackin - 1996
11
On Two Formal Analyses of the Yahalom Protocol (context) - Paulson - 1997
7
Stern: Automated Analysis of Cryptographic Protocols Using M.. (context) - Mitchell, Mitchell - 1997
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cl.cam.ac.uk/~lcp/papers/refereed.html): More
Set Theory for Verification: I. From Foundations to Functions - Paulson (1998)
(Correct)
Using Isabelle to Prove Properties of the Kerberos Authentication.. - Bella (1997)
(Correct)
Kerberos Version IV: Inductive Analysis of the Secrecy Goals - Bella, Paulson (1998)
(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