Automatic validation of protocol narration

We perform a systematic expansion of protocol narrations into terms of process algebra in order to make precise some of the detailed checks that need to be made in a protocol. We then apply static analysis technology to develop an automatic validation procedure for protocols. Finally, we demonstrate...

Full description

Saved in:
Bibliographic Details
Published in16th IEEE Computer Security Foundations Workshop, 2003. Proceedings pp. 126 - 140
Main Authors Bodei, C., Buchholtz, M., Degano, P., Nielson, F., Riis Nielson, H.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2003
Subjects
Algebra
Artificial intelligence
Authentication
Cryptography
Informatics
Internet
Mathematical model
Protocols
Security
Testing
Online AccessGet full text

Cover

More Information
Summary:We perform a systematic expansion of protocol narrations into terms of process algebra in order to make precise some of the detailed checks that need to be made in a protocol. We then apply static analysis technology to develop an automatic validation procedure for protocols. Finally, we demonstrate that these techniques suffice for identifying a number of authentication flaws in symmetric key protocols such as Needham-Schroeder, Otway-Rees, Yahalom and Andrew Secure RPC.
ISBN:076951927X
9780769519272
ISSN:1063-6900
2377-5459
DOI:10.1109/CSFW.2003.1212709