Provably secure group authentication and key agreement for machine type communication using Chebyshev’s polynomial

Abstract

While the current cellular networks are optimized only for Human to Human, or Human Type Communication (HTC), the future generation of cellular networks foresees a rapid growth in the quantum of Machine Type Communication (MTC) i.e., communication among heterogeneous entities without the involvement of any human entity which can be seen in different Internet of Things(IoT) applications. A significant issue in Machine Type Communication is the presence of large numbers of communicating devices overloading the network with their signaling messages. This overload can have negative impacts in terms of delays and termination of security procedures, like authentication, affecting both HTC and MTC. In this paper, we propose a group authentication and key agreement protocol using Extended Chebyshev’s Chaotic Map. The proposed protocol provides an efficient, in terms of reduced signaling traffic generated during the authentication procedure, and provably secure method for authenticating a group of MTCDs by the core network. The security analysis of the proposed protocol shows that it is secured against various threats like man-in-the-middle, replay attack etc.