This paper presents a general approach for analysis and verification of authentication properties in the language of Communicating Sequential Processes (CSP). It is illustrated by an examination of the Needham-Schroeder public-key protocol. The contribution of this paper is to develop a specific theory appropriate to the analysis of authentication protocols, built on top of the general CSP semantic framework. This approach aims to combine the ability to express such protocols in a natural and precise way with the facility to reason formally about the properties they exhibit.
Index Terms:
Authentication, security protocols, formal methods, CSP, verification, Needham-Schroeder protocol.
Citation:
Steve Schneider, "Verifying authentication protocols with CSP," csfw, pp.3, 10th Computer Security Foundations Workshop (CSFW '97), 1997