See this document in CiteSeerX!

Mechanized Proofs for a Recursive Authentication Protocol (1997)  (Make Corrections)  (48 citations)
Lawrence C. Paulson
10th Computer Security Foundations Workshop



  Home/Search   Context   Related

 
View or download:
cl.cam.ac.uk/paper...18lcprecur.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  indiana.edu/pub/ucstri/index (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: A novel protocol has been formally analyzed using the prover Isabelle/HOL, following the inductive approach described in earlier work [11]. There is no limit on the length of a run, the nesting of messages or the number of agents involved. A single run of the protocol delivers session keys for all the agents, allowing neighbours to perform mutual authentication. The basic security theorem states that session keys are correctly delivered to adjacent pairs of honest agents, regardless of whether... (Update)

Cited by:   More
A Cryptographically Sound Dolev-Yao Style Security Proof of the.. - Backes (2004)   (Correct)
Inductive Verification of Cryptographic Protocols - Bella (2000)   (Correct)
Mechanising BAN Kerberos by the Inductive Method - Bella, Paulson (1998)   (Correct)

Similar documents (at the sentence level):
30.4%:   The Inductive Approach to Verifying Cryptographic Protocols - Paulson (1998)   (Correct)

Active bibliography (related documents):   More   All
0.5:   CSP, PVS and a Recursive Authentication Protocol - Bryans, Schneider   (Correct)
0.0:   The Logic of Authentication Protocols - Syverson, Cervesato (2001)   (Correct)
0.0:   Mechanized Proofs of Security Protocols: Needham-Schroeder with.. - Paulson (1997)   (Correct)

Similar documents based on text:   More   All
0.1:   Mechanizing Set Theory - Cardinal Arithmetic and the Axiom.. - Paulson, Grabczewski (2000)   (Correct)
0.1:   Should Your Specification Language Be Typed? - Lamport, Paulson (1998)   (Correct)
0.1:   Proving Properties of Security Protocols by Induction - Paulson (1997)   (Correct)

Related documents from co-citation:   More   All
29:   Using encryption for authentication in large networks of computers (context) - Needham, Schroeder - 1978
24:   Proving properties of security protocols by induction - Paulson - 1997
22:   IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983

BibTeX entry:   (Update)

Paulson, L. Mechanized proofs for a recursive authentication protocol. In 10th IEEE Computer Security Foundations Workshop (1997), pp. 84--95. http://citeseer.ist.psu.edu/article/paulson97mechanized.html   More

@inproceedings{ paulson97mechanized,
    author = "Lawrence C. Paulson",
    title = "Mechanized Proofs for a Recursive Authentication Protocol",
    booktitle = "10th Computer Security Foundations Workshop",
    publisher = "IEEE Computer Society Press",
    pages = "84--95",
    year = "1997",
    url = "citeseer.ist.psu.edu/article/paulson97mechanized.html" }
Citations (may not include all citations):
322   Breaking and fixing the Needham-Schroeder public-key protoco.. - Lowe - 1996
302   A logic of authentication - Burrows, Abadi et al. - 1989
143   Proving properties of security protocols by induction - Paulson
110   Casper: A compiler for the analysis of security protocols - Lowe
81   Isabelle: A Generic Theorem Prover (context) - Paulson - 1994
63   Operating Systems Review (context) - Otway, Rees et al. - 1987
55   Analyzing the Needham-Schroeder public-key protocol: A compa.. - Meadows - 1996
26   Prudent engineering practice for cryptographic protocols (context) - Abadi, Needham - 1996
24   An approach to the formal verification of cryptographic prot.. - Bolignano - 1996
2   Technical Report DRA/CIS3/PROJ/CORBA/SC/1/CSM (context) - Bull, Otway et al. - 1997



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www.cs.indiana.edu/pub/ucstri/index):   More
Environment Modelling for Mobile Robots: Neural Learning for.. - van Dam (1998)   (Correct)
Broadcasting in Butterfly and DeBruijn Networks - Klasing, Monien, Peine, Stöhr (1992)   (Correct)
ILFA - A Project in Experimental Logic Computation - Dunker, Flögel, Büning..   (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