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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Schneider, S., & Delicata, R. (2005). Verifying security protocols: An application of CSP. In Lecture Notes in Computer Science (Vol. 3525, pp. 243–263). Springer Verlag. https://doi.org/10.1007/11423348_14
Mendeley helps you to discover research relevant for your work.