CCAKESC: Chaotic map‐based construction of a new authenticated key exchange protocol for satellite communication

Abstract

Summary Recently, many authentication schemes were proposed by researchers in the satellite communication environment. Unfortunately, several types of security flaws occur in relative works (Qi et al., 2019; Xu, 2019; Liu et al., 2017; Altaf et al., 2020), such as off‐line guessing attacks, smart card stolen attacks and replay attacks. In this paper, we proposed a secure authentication technique based on chaotic maps to solve these drawbacks. To establish the security of the proposed scheme, we employ formal proof under the random oracle model. In addition, an informal study with various security properties is provided to augment the security characteristics. Furthermore, we compare our protocol to several current schemes and demonstrate that our plan meets the security criteria while being cost‐effective. As a result, it is more suited to the satellite communication environment.

A construction of Chebyshev chaotic map based authenticated key agreement protocol for satellite communication system

“…Recently, Uddeshaya et al 15 has proposed a chaotic map based authenticated key agreement protocol for vehicular communication. They have claimed that their protocol 15 is secure against existing attacks, and it is more efficient as compared to other relevant schemes for satellite communication. But, we have analyzed their scheme has some flaws in the design.…”

“…But, we have analyzed their scheme has some flaws in the design. Moreover, their scheme 15 is traceable and suffers from insider attack. The protocol 15 stores more number of values on the server side that creates server's overhead.…”

“…Biometric hashing 15 is an advanced technology pretty similar to traditional cryptographic hashing that is a one‐way collision resistant function converts biometric into a non‐reversible cryptographic hash. Due to the noisy nature of biometric data, bio‐hashing $$$ {H}_B $$$ takes arbitrary n bit string input of imprints and produces an output of fixed m bits.…”

“…In Uddeshaya et al scheme, 15 we have observed some flaws in the design of the protocol. In the registration phase, the protocol uses symbol “$$$ \sigma $$$,” but they have not defined it about the value $$$ \sigma $$$ itself.…”

“…From the Table 2, we can analyze the communication comparison the introduced design with other recently published schemes for satellite communication. We have computed the communication costs for the protocols 15,14,11,21,13 in the Table 2. We have considered the following bit lengths, an identity $$$ {ID}_i $$$, time stamps $$$ {T}_1,{T}_2 $$$, takes 64 bits, symmetric encryption takes 128 bits, chaotic mapping and the hashing takes 160 bits, and the random prime p takes 1024 bits respectively.…”