Group Security Authentication and Key Agreement Protocol Built by Elliptic Curve Diffie Hellman Key Exchange for LTE Military Grade Communication

Abstract

4G mobile communication is a global technology. Therefore, it is essential to enforce confidentiality between mobile users and their networks. This paper presents a Group Security Authentication and Key Agreement Protocol Built by Elliptic Curve Diffie Hellman Key Exchange (GSAKA-ECDHKE) to overcome and address the LTE networks Evolved Packet System Authentication and Key Agreement Protocol (EPS-AKA) protocol flaws and vulnerabilities. GSAKA-ECDHKE is presented for 4G mobile military group communications to provide security, confidentiality, and privacy while the users and networks authenticate. By embedding the Group Commander (GC) role in the EPS-AKA protocol to control the member authentication in the group. GSAKA-ECDHKE protocol is based on Elliptic Curve Diffie Hellman Key Exchange (ECDHKE) and hash function to generate and share secret Elliptic Curve (EC) key to encrypt and protect the routing authentication parameters. The Automated Validation of Internet Security Protocols and Applications (AVISPA) tool is used for security analysis and formal verification. AVISPA demonstrated that GSAKA-ECDHKE had overcome various known security attacks such as Man In The Middle (MITM), replay attacks, and Denial of Services (DoS) attacks, satisfying the evaluated security requirements. Additionally, the suggested protocol provides the lowest communication overheads compared to the existing group-based AKA protocols.

A Dynamic and Efficient Self-Certified Authenticated Group Key Agreement Protocol for VANET

“…Cui et al [20] offered a full session AGKA protocol based on a chaotic map for VANET. GSAKA-ECDHKE [21] was a scheme to realize secure group communications using 4G LTE in a military VANET. Al-Shareeda [22] proposed an AGKA protocol for VANET.…”

“…Flaws Imgresson [7] First GKA using DHKE No authentication gk = g x 3 x 0 +x 3 x 1 +x 3 x 2 +x 2 x 0 +x 2 x 1 +x 1 x 0 STR [8] A complete GKA using DHKE No authentication gk = g xng x n−1 g •••g x 3 g x 1 x 2 BD [9] Two-round GKA using DHKE No authentication gk = g x 1 x 2 +x 2 x 3 +•••+xnx 1 Katz [10] Proposes a compiler using signatures, extends BD to AGKA Three-round AGKA protocol, with the compiler, proves inefficient communication security in standard model DB [11] Two-round AGKA in dynamic setting, using BD and signatures, Leaving user attacks provides formal security model and replay attacks Reddy [13] First dynamic ID-based AGKA, Inefficient communication using binary trees and an ID-based key agreement protocol Heo [14] First dynamic certificateless AGKA, Inefficient communication using binary trees and a modified certificateless key agreement protocol Wan [15] First anonymous AGKA using Colluding attacks ID-based encryption Abbasinezhad-Mood [16] Employs Chebyshev chaotic map No dynamicity Xu [18] Employs certificateless aggregate No support to V2V communications signatures Wang [19] Employs BD protocol Inefficient computation Cui [20] Employs chaotic-map No unlinkability Moussa [21] Employs EPS-AKA No anonymity Al-Shareeda [22] Employs Chinese remainder theorem No support to V2V communications Zhao [23] Employs Chinese remainder theorem No support to V2V communications and fog nodes Li [24] Employs group signatures Inefficient computation…”

Masked Location based Key Exchange Mechanism for IoT Nodes

“…A distinct version elliptic curve point generation procedure is used in this module [23]. The point generation relies on three numbers namely 𝑝 is a prime number, 𝑎 and 𝑏 are two random integers.…”

A Lightweight PUF-based Secure Group Communication Scheme for Wireless Sensor Networks With Dynamic Group Membership

“…Two SGC schemes [4], [5] that use mainly symmetric key cryptography are lightweight but they both have limited scalability for GMM as the rekeying process requires unicast communication between the central node and all the group members. A number of recent solutions have resorted to PKC algorithms [6], [7], especially the Elliptic Curve Cryptography [8], [9], Diffie-Hellman key exchange [9], [10] and identity-based encryption schemes [11] for group key agreement. Compared to symmetric key based schemes, PKC solutions are much slower and requires more computational resources.…”