A secure authentication and key agreement scheme for roaming service with user anonymity

Abstract

Nowadays, with the advancement of wireless technologies, global mobility networks offer roaming services for mobile users. Since in global mobility networks the communication channel is public, adversaries can launch different security attacks to breach the security and privacy of data and mobile users. Hence, an authentication and key agreement scheme can be used to provide secure roaming services. It is well known that the conventional authentication schemes are not suitable for global mobility networks, because the authentication server of each network has the credentials of its registered users and thus cannot verify the authenticity of the other mobile users. Hence, for providing secure roaming services, another type of authentication called roaming authentication is required. Hitherto, a large number of authentication protocols have been proposed for global mobility networks. However, most of them have been proved to be insecure against various attacks. This paper proposes a secure and efficient authentication and key agreement scheme for global mobility networks. The proposed scheme is based on the elliptic curve cryptosystem. The correctness of the proposed scheme is verified using Burrows-Abadi-Needham logic.In addition, the security of the proposed scheme is proved using ProVerif. Detailed analyses demonstrate that the proposed scheme not only withstands various security attacks but also improves the efficiency by reducing the computational costs. KEYWORDS authentication, global mobility network (GLOMONET), key agreement, roaming service, security Int J Commun Syst. 2017;30:e3361.wileyonlinelibrary.com/journal/dac

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.…”

“…Thus, to fix the issues of the scheme of Farash et al, they proposed an enhanced authentication scheme. Nevertheless, quite recently, Arshad and Rasoolzadegan have indicated the susceptibility of the presented scheme in the study of Karuppiah et al against the off‐line password‐guessing attack and the perfect forward insecurity. At the same year, Gope and Hwang evaluated the security of the suggested authentication scheme by He et al and claimed that their scheme cannot withstand the forgery attack and has unfair key agreement.…”

“…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 do so, the HA and FA need to authenticate the MU. It should be noted here that, as properly stated in the study of Arshad and Rasoolzadegan, the conventional authentication methods are not suitable for the GLOMONET, and we need to apply an adapted authentication, which is referred to as the roaming authentication. As depicted in Figure , for the roaming authentication, if the MU be in his/her registered network, the HA can directly verify the authenticity of the MU.…”

“…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.…”