An efficient authentication and key agreement scheme with user anonymity for roaming service in smart city

Efficient privacy‐preserving authentication scheme for roaming consumer in global mobility networks

“…However, Xie et al have taken the advantage of the chaotic map‐based Diffie‐Hellman problem for the key establishment. Despite the nice contributions of the papers, after careful consideration, we found that the presented authentication and key agreement protocols in all of these four are susceptible to the known session‐specific temporary information attack, and in case of the ephemeral secret leakage, the session key is revealed to adversary.…”

“…The GLOMONET offers several roaming services, and the advancements in wireless and communication technologies have paved the way for offering robust roaming services. In GLOMONET, there exist three entities, , namely, “mobile user” (MU), “home agent” (HA), and “foreign agent” (FA). The MU firstly registers himself/herself at the HA through a reliable medium to get his/her desired services.…”

“…To remedy the security flaws of the previous schemes, a very efficient elliptic curve cryptography (ECC)‐based authentication and key agreement scheme has been presented quite recently by Arshad and Rasoolzadegan for the GLOMONET. In addition, three other schemes have been proposed in the current year by Li et al, Chen and Peng, and Xie et al Same as Arshad and Rasoolzadegan, Li et al and Chen and Peng have utilized the ECC for the key agreement. However, Xie et al have taken the advantage of the chaotic map‐based Diffie‐Hellman problem for the key establishment.…”

“…The contribution of this paper is threefold. Cryptanalysis of the presented schemes in previous studies and indicating their vulnerability against the known session‐specific information attack. Presenting a new authentication and key agreement scheme for GLOMONET that not only can resist the known session‐specific information attack and the other well‐known attacks but also is much more efficient in terms of both communication overhead and computational complexity. Comprehensive descriptive discussion on security besides formal validation of security using the widely accepted ProVerif tool and comparative efficiency analysis for both communication and computational costs for different number of key agreements. …”

“…The rest of this paper is organized as the following sections. In Section , cryptanalysis of the schemes is presented. The preliminaries and threat model, which are employed is this paper, are explained in Section .…”