Proving Properties of Security Protocols by Induction (1997)
Cached
Download Links
- [www.cl.cam.ac.uk]
- [www.cl.cam.ac.uk]
- [www.cl.cam.ac.uk]
- [www.cl.cam.ac.uk]
- DBLP
Other Repositories/Bibliography
| Venue: | In 10th IEEE Computer Security Foundations Workshop |
| Citations: | 138 - 7 self |
BibTeX
@INPROCEEDINGS{Paulson97provingproperties,
author = {Lawrence C. Paulson},
title = {Proving Properties of Security Protocols by Induction},
booktitle = {In 10th IEEE Computer Security Foundations Workshop},
year = {1997},
pages = {70--83},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 model accidental key losses as well as attacks. The model spy can send spoof messages made up of components decrypted from previous traffic. Several key distribution protocols have been studied, including NeedhamSchroeder, Yahalom and Otway-Rees. The method applies to both symmetrickey and public-key protocols. A new attack has been discovered in a variant of Otway-Rees (already broken by Mao and Boyd). Assertions concerning secrecy and authenticity have been proved. CONTENTS i Contents 1 Intro...
