Verifying authentication protocols in CSP
Schneider, Steve A. (1998) Verifying authentication protocols in CSP IEEE Transactions on Software Engineering, 24. pp. 741-758.
This paper presents a general approach for analysis and verification of authentication properties using the theory of Communicating Sequential Processes (CSP). The paper aims to develop a specific theory appropriate to the analysis of authentication protocols, built on top of the general CSP semantic framework. This approach aims to combine the ability to express such protocols in a natural and precise way with the ability to reason formally about the properties they exhibit. The theory is illustrated by an examination of the Needham-Schroeder Public-Key protocol. The protocol is first examined with respect to a single run and then more generally with respect to multiple concurrent runs.
|Additional Information:||Schneider, S. (1998). Verifying Authentication Protocols in CSP. IEEE Transactions on Software Engineering, 24, 741-758. © 1998 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.|
|Uncontrolled Keywords:||Authentication, security protocols, formal methods, CSP, verification, Needham-Schroeder protocol|
|Divisions:||Faculty of Engineering and Physical Sciences > Computing Science|
|Depositing User:||Mr Adam Field|
|Date Deposited:||27 May 2010 14:46|
|Last Modified:||23 Sep 2013 18:35|
Actions (login required)
Downloads per month over past year