Verifying authentication protocols with CSP.
Tools
Tools
Tools
Schneider, S (1997) Verifying authentication protocols with CSP. In: IEEE Computer Security Foundations Workshop, 1997-06-10 - 1997-06-12, Rockport, MA , USA.
![[img]](/style/images/fileicons/application_pdf.png)
| PDF Available under License : See the attached licence file. 241Kb | |
![[img]](/style/images/fileicons/text_plain.png) | Plain Text (licence) 1516b |
Official URL: http://dx.doi.org/10.1109/CSFW.1997.596775
Abstract
This paper presents a general approach for analysis and veri cation of authentication properties in the language of Communicating Sequential Processes CSP It is il lustrated by an examination of the Needham Schroeder public key protocol The contribution of this paper is to develop a speci c theory appropriate to the analy sis of authentication protocols built on top of the gen eral CSP semantic framework This approach aims to combine the ability to express such protocols in a natu ral and precise way with the facility to reason formally about the properties they exhibit
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | Copyright 2008 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| Related URLs: | |
| ID Code: | 7231 |
| Deposited By: | Symplectic Elements |
| Deposited On: | 03 Feb 2012 14:45 |
| Last Modified: | 16 Feb 2013 16:10 |
Document Downloads
Repository Staff Only: item control page