Cryptographic Key Exchange Protocol with Message Authentication Codes (MAC) using Finite State Machine

Abstract In this work, we explore the authentication and verification of key exchange protocol using Message Authentication Code (MAC). We propose a new MAC scheme model using input-output automata to protect the integrity of the secret key in the key exchange protocol. Our scheme was devised in reference to the Diffie-Hellman communication protocol model. We divided our MAC protocol into three stages of communication sequences in order to simplify the model and the design of automata machine. In the final result, we combined all stages and represented the protocol as Cryptographic MAC Protocol in the regular language. We have shown that the cryptographic MAC protocol for key exchange protocol can be implemented using finite input-output automata with some small modification of the finite state machine. The proposed protocol would be useful for implementation ina lightweight or a secure smart devicescommunication in the wireless sensor nodes (WSN) network.

[1]  Ángel Martín del Rey,et al.  Message Authentication Protocol Based on Cellular Automata , 2009, EvoWorkshops.

[2]  John C. Mitchell,et al.  Multiset rewriting and the complexity of bounded security protocols , 2004, J. Comput. Secur..

[3]  Feng Bao.  Cryptanalysis of a Partially Known Cellular Automata Cryptosystem , 2004, IEEE Trans. Computers.

[4]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[5]  Gina Maira Barbosa de Oliveira,et al.  Secret Key Specification for a Variable-Length Cryptographic Cellular Automata Model , 2010, PPSN.

[6]  Burcu Kulahcioglu,et al.  Utilization of Timed Automata as a Verification Tool for Security Protocols , 2010, 2010 Fourth International Conference on Secure Software Integration and Reliability Improvement Companion.

[7]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[8]  Jamalul-lail Ab Manan,et al.  A Secure TFTP Protocol with Security Proofs , 2014, ArXiv.

[9]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[10]  Carsten Rudolph,et al.  Role based specification and security analysis of cryptographic protocols using asynchronous product automata , 2002, Proceedings. 13th International Workshop on Database and Expert Systems Applications.

[11]  Eric Rescorla,et al.  Diffie-Hellman Key Agreement Method , 1999, RFC.

[12]  Parimal Pal Chaudhuri,et al.  Cellular Automata Based Authentication (CAA) , 2002, ACRI.

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

[14]  Stelvio Cimato,et al.  Modeling A Certified Email Protocol using I/O Automata , 2004, Electron. Notes Theor. Comput. Sci..

[15]  Wojciech Penczek,et al.  Timed Automata Based Model Checking of Timed Security Protocols , 2009, Fundam. Informaticae.

[16]  Jamalul-lail Ab Manan,et al.  An Experimental Study of Cryptography Capability using Chained Key Exchange Scheme for Embedded Devices , 2014, ArXiv.

[17]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[18]  Pieter H. Hartel,et al.  Timed model checking of security protocols , 2004, FMSE '04.

[19]  Habibah Hashim,et al.  Performance measurement of secure TFTP protocol for smart embedded devices , 2014, 2014 IEEE Asia Pacific Conference on Wireless and Mobile.

[20]  Nancy A. Lynch,et al.  I/O automaton models and proofs for shared-key communication systems , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[21]  H. Hashim,et al.  A lightweight and secure TFTP protocol for smart environment , 2012, 2012 International Symposium on Computer Applications and Industrial Electronics (ISCAIE).

[22]  Eun-Jun Yoon,et al.  An Efficient Diffie-Hellman-MAC Key Exchange Scheme , 2009, 2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC).

[23]  Ronald Cramer,et al.  A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack , 1998, CRYPTO.

[24]  Nan Liu,et al.  Security Protocol Analysis Based on Rewriting Approximation , 2009, 2009 Second International Symposium on Electronic Commerce and Security.

[25]  Stephen Wolfram.  Cryptography with Cellular Automata , 1985, CRYPTO.