Formal Analysis for Cryptographic Protocols on a Trace Semantics

The analysis and verification of security protocols is an important field in the security of computer nowadays. Formal method has been advocated as an important means of improving the safety and reliability of software systems, especial those which are safety-critical. We propose a new simple trace semantics that can be used to analyse Cryptographic Protocols. Our technique support a protocol designer to provide formal Analysis of the security properties. We illustrate the utility of our technique by exposing two attacks on the well studied protocol TMN.

[1]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  Martín Abadi,et al.  A logic of authentication , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[3]  Yong Li,et al.  Checking Temporal Duration Properties of timed automata , 2008, Journal of Computer Science and Technology.

[4]  Gavin Lowe,et al.  Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR , 1996, Softw. Concepts Tools.

[5]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[6]  Riccardo Sisto,et al.  Using SPIN to Verify Security Properties of Cryptographic Protocols , 2002, SPIN.