Lawrence C. Paulson  Home/Search
Context Related
| cl.cam.ac.uk/ftp/p...byInduction.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF Problem Downloading? From: cl.cam.ac.uk/users/lcp...refereed (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Informal justifications of security protocols involve arguing backwards that various events are impossible. Inductive definitions can make such arguments rigorous. The resulting proofs are complicated, but can be generated reasonably quickly using the proof tool Isabelle/HOL. There is no restriction to finite-state systems and the approach is not based on belief logics. Protocols are inductively defined as sets of traces, which may involve many interleaved protocol runs. Protocol descriptions... (Update)
Cited by: More
Relating State-Based and Process-Based Concurrency through.. - Cervesato, Scedrov (2006) (Correct)
A Comparison between Strand Spaces and Multiset.. - Cervesato, Durgin.. (2002) (Correct)
Relating Multiset Rewriting and Process - Algebras For Security (Correct)
Similar documents (at the sentence level):
37.5%: The Inductive Approach to Verifying Cryptographic Protocols - Paulson (1998) (Correct)
Active bibliography (related documents): More All
0.5: A Fixedpoint Approach to (Co)Inductive and (Co)Datatype Definitions - Paulson (1997) (Correct)
0.3: Analysis of Security Protocols - Durgin, MITCHELL (1999) (Correct)
0.3: Mechanized Proofs of Security Protocols: Needham-Schroeder with.. - Paulson (1997) (Correct)
Similar documents based on text: More All
0.1: Mechanising BAN Kerberos by the Inductive Method - Bella, Paulson (1998) (Correct)
0.1: Kerberos Version IV: Inductive Analysis of the Secrecy Goals - Bella, Paulson (1998) (Correct)
0.1: Using Isabelle to Prove Properties of the Kerberos Authentication.. - Bella (1997) (Correct)
Related documents from co-citation: More All
51: Breaking and fixing the Needham-Schroeder public-key protocol using FDR - Lowe - 1996
45: Using encryption for authentication in large networks of computers (context) - Needham, Schroeder - 1978
38: Automated analysis of cryptographic protocols using MurOE - Mitchell, Mitchell et al. - 1997
BibTeX entry: (Update)
L. Paulson. Proving properties of security protocols by induction. In Proceedings of the 10th IEEE Computer Security Foundations Workshop, pages 70--83, 1997. http://citeseer.ist.psu.edu/paulson97proving.html More
@inproceedings{ paulson97proving,
author = "Lawrence C. Paulson",
title = "Proving Properties of Security Protocols by Induction",
booktitle = "10th Computer Security Foundations Workshop",
publisher = "IEEE Computer Society Press",
pages = "70--83",
year = "1997",
url = "citeseer.ist.psu.edu/paulson97proving.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985 ACM DBLP
404 A calculus for cryptographic protocols: The spi calculus - Abadi, Gordon - 1997 DBLP
322 Breaking and fixing the Needham-Schroeder public-key protoco.. - Lowe - 1996
302 A logic of authentication - Burrows, Abadi et al. - 1989 ACM DBLP
294 Isabelle: A Generic Theorem Prover (context) - Paulson - 1994
171 Prudent engineering practice for cryptographic protocols - Abadi, Needham - 1996 ACM DBLP
128 Why cryptosystems fail - Anderson - 1994 ACM DBLP
121 Three systems for cryptographic protocol analysis (context) - Kemmerer, Meadows et al. - 1994
97 An introduction to inductive definitions (context) - Aczel - 1977
52 The Semantics of Programming Languages: An Elementary Introd.. (context) - Hennessy - 1990 ACM
51 Programming Satan's computer - Anderson, Needham - 1995 DBLP
46 Some new attacks upon security protocols - Lowe - 1996 ACM DBLP
38 What do we mean by entity authentication (context) - Gollmann - 1996
25 Towards formal analysis of security protocols - Mao, Boyd - 1993 DBLP
24 An approach to the formal verification of cryptographic prot.. - Bolignano - 1996 ACM DBLP
23 A HOL extension of GNY for automatically analyzing cryptogra.. - Brackin - 1996 ACM DBLP
19 Mechanized proofs of security protocols: Needham-Schroeder w.. - Paulson - 1997
12 Information Processing Letters (context) - Clark, Jacob et al. - 1995
3 Technical Report DRA/CIS3/SISG/CR (context) - Ryan, verification et al. - 1996
3 AS: A case study in using CSP to detect errors in security p.. (context) - Lowe - 1996
2 Tool support for logics of programs - Paulson - 1996
1 Formal verification of cryptographic protocols using Coq (context) - Bolignano - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cl.cam.ac.uk/users/lcp/papers/refereed.html): More
Generic Automatic Proof Tools - Paulson (1997) (Correct)
A Generic Tableau Prover and its Integration with Isabelle - Paulson (1998) (Correct)
A Concrete Final Coalgebra Theorem for ZF Set Theory - Paulson (1994) (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