Verifying Security Protocols: An Application of CSP

  • Steve Schneider
  • Rob Delicata
Conference paper

DOI: 10.1007/11423348_14

Volume 3525 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Schneider S., Delicata R. (2005) Verifying Security Protocols: An Application of CSP. In: Abdallah A.E., Jones C.B., Sanders J.W. (eds) Communicating Sequential Processes. The First 25 Years. Lecture Notes in Computer Science, vol 3525. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Steve Schneider
    • 1
  • Rob Delicata
    • 1
  1. 1.Department of ComputingUniversity of Surrey