Analysing Time Dependent Security Properties in CSP Using PVS

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.

[1]  Lawrence Charles Paulson,et al.  Isabelle: A Generic Theorem Prover , 1994 .

[2]  Martín Abadi,et al.  A logic of authentication , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[3]  John A. Clark,et al.  On the Security of Recent Protocols , 1995, Inf. Process. Lett..

[4]  Joshua D. Guttman,et al.  Mixed strand spaces , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[5]  Steve Schneider,et al.  Concurrent and Real Time Systems , 1999 .

[6]  Gavin Lowe,et al.  Casper: a compiler for the analysis of security protocols , 1997, Proceedings 10th Computer Security Foundations Workshop.

[7]  Steve A. Schneider,et al.  Timewise Refinement for Communicating Processes , 1993, Sci. Comput. Program..

[8]  Steve A. Schneider.  Verifying Authentication Protocols in CSP , 1998, IEEE Trans. Software Eng..

[9]  Steve A. Schneider,et al.  Using a PVS Embedding of CSP to Verify Authentication Protocols , 1997, TPHOLs.

[10]  Natarajan Shankar,et al.  PVS: A Prototype Verification System , 1992, CADE.

[11]  Stephen J. Garland,et al.  PVS: A Prototype . . . , 1992 .

[12]  Catherine A. Meadows,et al.  Language generation and verification in the NRL protocol analyzer , 1996, Proceedings 9th IEEE Computer Security Foundations Workshop.

[13]  Joshua D. Guttman,et al.  Strand Spaces: Proving Security Protocols Correct , 1999, J. Comput. Secur..

[14]  F. Javier Thayer Fábrega,et al.  Strand spaces: proving security protocols correct , 1999 .

[15]  Royal Holloway,et al.  Timewise Reenement for Communicating Processes , 1997 .

[16]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[17]  Giampaolo Bella.  Using Isabelle to Prove Properties of the Kerberos Authentication System , 1997 .