Communicating Sequential Processes. The First 25 Years

Volume 3525 of the series Lecture Notes in Computer Science pp 243-263

Verifying Security Protocols: An Application of CSP

  • Steve SchneiderAffiliated withDepartment of Computing, University of Surrey
  • , Rob DelicataAffiliated withDepartment of Computing, University of Surrey

* Final gross prices may vary according to local VAT.

Get Access


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.