Analysing Time Dependent Security Properties in CSP Using PVS.
Tools
Tools
Tools
Evans, N and Schneider, S (2000) Analysing Time Dependent Security Properties in CSP Using PVS. In: European Symposium on Research in Computer Security, 2000-10-04 - 2000-10-06, Toulouse, France.
![[img]](/style/images/fileicons/application_pdf.png)
| PDF - Accepted Version Available under License : See the attached licence file. 182Kb | |
![[img]](/style/images/fileicons/text_plain.png) | Plain Text (licence) 1516b |
Official URL: http://dx.doi.org/10.1007/10722599_14
Abstract
This paper details an approach to verifying time dependent authentication properties of security protocols. We discuss the introduction of time into the Communicating Sequential Processes (CSP) protocol verification framework of [11]. The embedding of CSP in the theorem prover PVS (Prototype Verification System) is extended to incorporate event-based time, retaining the use of the existing rank function approach to verify such properties. An example analysis is demonstrated using the Wide-Mouthed Frog protocol.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| Related URLs: | |
| ID Code: | 7187 |
| Deposited By: | Symplectic Elements |
| Deposited On: | 29 Sep 2011 12:19 |
| Last Modified: | 16 Feb 2013 16:10 |
Document Downloads
Repository Staff Only: item control page