Verifying Security Protocols: An Application of CSP
Schneider, Steve and Delicata, Robert (2005) Verifying Security Protocols: An Application of CSP In: UNSPECIFIED UNSPECIFIED, pp. 243-263.
The field of protocol analysis is one area in which CSP has proven particularly successful, and several techniques have been proposed that use CSP to reason about security properties such as confidentiality and authentication. In this paper we describe one such approach, based on theorem-proving, that uses the idea of a rank function to establish the correctness of protocols. This description is motivated by the consideration of a simple, but flawed, authentication protocol. We show how a rank function analysis can be used to locate this flaw and prove that a modified version of the protocol is correct.
|Item Type:||Book Section|
|Divisions :||Faculty of Engineering and Physical Sciences > Computing Science|
|Date :||4 May 2005|
|Identification Number :||https://doi.org/10.1007/b136154|
|Additional Information :||This is a pre-press version of an article published in Lecture Notes in Computer Science, 3525, 243-263. Click here to access the published version. © 2005 Springer.|
|Depositing User :||Mr Adam Field|
|Date Deposited :||27 May 2010 14:45|
|Last Modified :||23 Sep 2013 18:35|
Actions (login required)
Downloads per month over past year