(Enter summary)
Abstract: Informal arguments that cryptographic protocols are secure can be made rigorous using inductive definitions. The approach is based on ordinary predicate calculus and copes with infinite-state systems. Proofs are generated using Isabelle/HOL. The human effort required to analyze a protocol can be as little as a week or two, yielding a proof script that takes a few minutes to run. Protocols are inductively defined as sets of traces. A trace is a list of communication events, perhaps comprising... (Update)
Cited by: More
Reconciling Two Views of Cryptography - The Computational Soundness
(Correct)
Representing the MSR Cryptoprotocol Specification Language.. - Cervesato, Stehr (2005)
(Correct)
Approximating Imperfect Cryptography in a Formal Model - Troina, Aldini, al. (2003)
(Correct)
Similar documents (at the sentence level): More
78.6%: The Inductive Approach to Verifying Cryptographic Protocols - Paulson (2000)
(Correct)
21.1%: Proving Properties of Security Protocols by Induction - Paulson (1997)
(Correct)
10.7%: Mechanized Proofs for a Recursive Authentication Protocol - Paulson (1997)
(Correct)
Active bibliography (related documents): More All
0.1: Kerberos Version IV: Inductive Analysis of the Secrecy Goals - Bella, Paulson (1998)
(Correct)
0.0: Mechanising BAN Kerberos by the Inductive Method - Bella, Paulson (1998)
(Correct)
0.0: Inductive Analysis of the Internet Protocol TLS - Paulson (1997)
(Correct)
Similar documents based on text: More All
0.1: Using Isabelle to Prove Properties of the Kerberos Authentication.. - Bella (1997)
(Correct)
0.1: Relations Between Secrets: Two Formal Analyses of the.. - Lawrence Paulson.. (1997)
(Correct)
0.1: Should Your Specification Language Be Typed? - Lamport, Paulson (1998)
(Correct)
Related documents from co-citation: More All
40: Breaking and fixing the Needham-Schroeder public-key protocol using FDR
- Lowe - 1996
33: Automated analysis of cryptographic protocols using MurOE
- Mitchell, Mitchell et al. - 1997
32: IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
BibTeX entry: (Update)
Lawrence C. Paulson. The inductive approach to verifying cryptographic protocols. Journal of Computer Security, 6:85--128, 1998. http://citeseer.ist.psu.edu/article/paulson98inductive.html More
@article{ paulson98inductive,
author = "Lawrence C. Paulson",
title = "The Inductive Approach to Verifying Cryptographic Protocols",
journal = "Journal of Computer Security",
volume = "6",
pages = "85--128",
year = "1998",
url = "citeseer.ist.psu.edu/article/paulson98inductive.html" }
Citations (may not include all citations):
1529
A method for obtaining digital signatures and public-key cry..
- Rivest, Shamir et al. - 1978
362
ML for the Working Programmer (context) - Paulson - 1996
294
Isabelle: A Generic Theorem Prover (context) - Paulson - 1994
99
Modelling and verifying key-exchange protocols using CSP and..
- Roscoe
47
Inductive analysis of the internet protocol TLS
- Paulson - 1997
47
Verifying authentication protocols with CSP
- Schneider
21
Generic automatic proof tools
- Paulson - 1997
21
An attack on a recursive authentication protocol: A cautiona.. (context) - Ryan, Schneider - 1997
11
On two formal analyses of the Yahalom protocol (context) - Paulson - 1997
3
Technical Report DRA/CIS3/SISG/CR (context) - Ryan, verification et al. - 1996
The graph only includes citing articles where the year of publication is known.
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