1997 IEEE Symposium on Security and Privacy
Automated analysis of cryptographic protocols using Mur/spl phi/
Oakland, CA
May 04-May 07
ISBN: 0-8186-7828-3
M. Mitchell, Dept. of Comput. Sci., Stanford Univ., CA, USA
U. Stern, Dept. of Comput. Sci., Stanford Univ., CA, USA
Abstract: A methodology is presented for using a general-purpose state enumeration tool, Mur/spl phi/, to analyze cryptographic and security-related protocols. We illustrate the feasibility of the approach by analyzing the Needham-Schroeder (1978) protocol, finding a known bug in a few seconds of computation time, and analyzing variants of Kerberos and the faulty TMN protocol used in another comparative study. The efficiency of Mur/spl phi/ also allows us to examine multiple terms of relatively short protocols, giving us the ability to detect replay attacks, or errors resulting from confusion between independent execution of a protocol by independent parties.
Index Terms:
cryptography; cryptographic protocol analysis; Mur/spl phi/; methodology; general-purpose state enumeration tool; security-related protocols; computation time; Kerberos; faulty TMN protocol; replay attack detection; errors; client server system; network operating system
Citation:
J.C. Mitchell, M. Mitchell, U. Stern, "Automated analysis of cryptographic protocols using Mur/spl phi/," sp, pp.0141, 1997 IEEE Symposium on Security and Privacy, 1997