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 [10]. The embedding of CSP in the theorem prover PVS (Prototype Verification System) is extended to incorporate eventbased 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. 1 Introduction There are many methods that model and analyse security policies of distributed systems. Typically, the policies concerning communication are achieved using security protocols in which the agents of a system are trusted to provide a degree of secure communication across the system's network. The complexity of security protocols and the size of distributed systems have often been too great for analyses without a great deal of abstraction. This can lead to o...

Citations