.png){kind=icon}
.png){kind=icon}
Return
Verifying authentication protocols in CSP
.png){kind=icon}
OA
AI
DOI：10.1109/32.713329.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper presents a general approach for analysis and verification of authentication properties using the theory of Communicating Sequential Processes (CSP). The paper aims 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 ability to reason formally about the propel-ties they exhibit. The theory is illustrated by an examination of the Needham-Schroeder Public-Key protocol. The protocol is first examined with respect to a single run and then more generally with respect to multiple concurrent runs.
Keywords:
authentication
security protocols
formal methods
CSP
verification
Needham-Schroeder protocol
Journal
IF:
5.6
Papers:
2.8K
Citations:
1.1W
Organization
No organization information available