A novel and provably secure authentication and key agreement scheme with user anonymity for global mobility networks. Issue 16 (7th July 2016)

• Record Type: Journal Article
• Authors: Wu, Fan; Xu, Lili; Kumari, Saru; Li, Xiong; Das, Ashok Kumar; Khan, Muhammad Khurram; Karuppiah, Marimuthu; Baliyan, Renuka
• Is Part Of: Security and communication networks. Volume 9:Issue 16(2016)
• Page Start: 3527
• Page End: 3542
• Publication Date: 2016-07-07
• Subjects: mutual authentication -- formal proof -- global mobility network -- smart card -- formal verification; Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.1558
• Languages: English
• ISSNs: 1939-0114

Abstract

Abstract: Ubiquitous networks support the roaming service for mobile communication devices. The mobile user can use the services in the foreign network with the help of the home network. Mutual authentication plays an important role in the roaming services, and researchers put their interests on the authentication schemes. Recently, in 2016, Gope and Hwang found that mutual authentication scheme of He et al. for global mobility networks had security disadvantages such as vulnerability to forgery attacks, unfair key agreement, and destitution of user anonymity. Then, they presented an improved scheme. However, we find that the scheme cannot resist the off‐line guessing attack and the de‐synchronization attack. Also, it lacks strong forward security. Moreover, the session key is known to HA in that scheme. To get over the weaknesses, we propose a new two‐factor authentication scheme for global mobility networks. We use formal proof with random oracle model, formal verification with the tool Proverif, and informal analysis to demonstrate the security of the proposed scheme. Compared with some very recent schemes, our scheme is more applicable. Copyright © 2016 John Wiley & Sons, Ltd. Abstract : We point out that Gope and Hwang's scheme has weaknesses. To get over the problems, a new two‐factor authentication and key agreement scheme for GLOMONETs are proposed. We use the formal proof, formal verification, and informal analysis to illustrate the security of our scheme.