Modeling for Security Verification of a Cryptographic Protocol with MAC Payload

We propose a new sub-term relation to specify syntax of messages with MAC (Message Authentication Code) payload for the cryptographic protocols in the strand space model. The sub-term relation was introduced to formal analysis of cryptographic protocols based on theorem proving, but some defects have been found in it. In the present paper, first, the operatorf is defined to the extend sub-term relation, which is used to amend its original flaws. Second, a new ideal is constructed, and is used to expand the bounds on the penetrator's abilities. Third, the decidable theorem for honesty of ideals holds as it is described under the extended sub-term relation is proved. Fourth, we propose the theorem of the satisfiability for decidable conditions of honest ideals and annotate how invariant-sets generate, which is used to verify security properties of cryptographic protocols.

[1]  Martín Abadi,et al.  Secrecy by typing in security protocols , 1999, JACM.

[2]  Andrew D. Gordon,et al.  Authenticity by typing for security protocols , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[3]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[4]  Jonathan K. Millen,et al.  The Interrogator model , 1995, Proceedings 1995 IEEE Symposium on Security and Privacy.

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

[6]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[7]  Jeannette M. Wing,et al.  Theory generation for security protocols , 1999 .

[8]  Rajeev Alur,et al.  A Temporal Logic of Nested Calls and Returns , 2004, TACAS.

[9]  Lawrence C. Paulson,et al.  Proving properties of security protocols by induction , 1997, Proceedings 10th Computer Security Foundations Workshop.

[10]  Dan Harkins,et al.  The Internet Key Exchange (IKE) , 1998, RFC.

[11]  Martín Abadi,et al.  A Calculus for Cryptographic Protocols: The spi Calculus , 1999, Inf. Comput..

[12]  Andrew D. Gordon,et al.  Ðð Blockinøöóòò Aeóøø× Ò Ìììóööøø Blockin Blockinð Óñôùøøö Ë Blockin , 2007 .

[13]  Martín Abadi,et al.  A logic of authentication , 1990, TOCS.

[14]  F. Javier Thayer Fábrega,et al.  Strand spaces: proving security protocols correct , 1999 .

[15]  Catherine A. Meadows,et al.  The NRL Protocol Analyzer: An Overview , 1996, J. Log. Program..

[16]  Martín Abadi,et al.  Secrecy types for asymmetric communication , 2001, Theor. Comput. Sci..

[17]  Robin Milner,et al.  Theories for the Global Ubiquitous Computer , 2004, FoSSaCS.

[18]  Philip Wadler,et al.  A Syntax for Linear Logic , 1993, MFPS.