A Secure and Effective Anonymous User Authentication Scheme for Roaming Service in Global Mobility Networks

Wen, Fuxi; Susilo, Willy; Yang, Guomin

doi:10.1007/s11277-013-1243-4

Cited by 73 publications

(62 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As the cost of XOR operation and module addition are rather cheap, these two operations are not included in the comparison, and only symmetric encryption/decryption operation, chaotic map operation, hash operation and modular exponential operation are evaluated. As shown in TABLE III, the computational cost of client in [9,10,13] is much cheap than PPRAS, however, as discussed previously, the scheme in Chongqing Research Program of Application Foundation and Advanced Technology (no. cstc-2014jcyjA40028, no.…”

Section: G1mentioning

confidence: 98%

“…FA believes that HA has verified MU's anonymous identity SID. [9,12] cannot resist to the man-in-the-middle attacks, and the scheme in [10] cannot preserve the user's privacy. However, the efficiency of [11] is not desirable.…”

Section: ) Goalsmentioning

confidence: 99%

“…The scheme in [13] is vulnerable to the replay attacks. Furthermore, the schemes in [9][10][11][12][13] will inevitably incur huge key management for the symmetric and public key encryption. Although no explicit advantage of performance for PPRAS cannot be found in TABLE III, the underlying featured chaotic map based encryption for handshake message would save much more computation and storage cost.…”

Section: ) Goalsmentioning

confidence: 99%

“…Li et al [8] proposed an efficient mobile networks authentication scheme, which can protect mobile users' privacy, while it is vulnerable to the manin-the-middle attacks. Shin et al [9] and Wen et al [10] proposed anonymous authentication schemes for mobile networks respectively, while Shin et al's [9] scheme cannot resist to the man-in-the-middle attacks, and Wen et al's [10] scheme will reveal the user's real identity. In 2014, Xie et al [11] proposed a mobile roaming authentication protocol and claimed this scheme can protect users' privacy; however, its efficiency is not desirable.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Privacy-Preserving Roaming Authentication Scheme for Ubiquitous Networks

Zhou¹,

Zhou²,

Wang³

2016

ijacsa

View full text Add to dashboard Cite

Abstract-A privacy-preserving roaming authentication scheme (PPRAS) for ubiquitous networks is proposed, in which a remote mobile user can obtain the service offered by a foreign agent after being authenticated. In order to protect the mobile user's privacy, the user presents an anonymous identity to the foreign agent with the assistance of his or her home agent to complete the authentication. After that, the user and the foreign agent can establish a session key using the semi-group property of Chebyshev polynomial. In this way, huge burden of key management is avoided. Furthermore, the user can update the login password and the session key between itself and the foreign agent if necessary. The correctness is proved using BAN logic, and the performance comparison against the existing schemes is given as well.

show abstract

Section: G1mentioning

confidence: 98%

Section: ) Goalsmentioning

confidence: 99%

Section: ) Goalsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Privacy-Preserving Roaming Authentication Scheme for Ubiquitous Networks

Zhou¹,

Zhou²,

Wang³

2016

ijacsa

View full text Add to dashboard Cite

show abstract

“…Recently, some new anonymous authentication schemes have been proposed [10][11][12][13][14][15][16][17]. This paper investigates these schemes based on security requirements for secure roaming services in GLOMONET and shows that most have several weaknesses.…”

Section: Introductionmentioning

confidence: 99%

An Efficient and Robust Anonymous Authentication Scheme in Global Mobility Networks

Ha¹

2015

IJSIA

View full text Add to dashboard Cite

show abstract

A lightweight anonymous authentication scheme for consumer roaming in ubiquitous networks with provable security

Farash

Chaudhry

Heydari

et al. 2015

Int J Communication

View full text Add to dashboard Cite

Ubiquitous networks provide roaming service for mobile nodes enabling them to use the services extended by their home networks in a foreign network. A mutual authentication scheme between the roamed mobile node and the foreign network is needed to be performed through the home network. Various authentication schemes have been developed for such networks, but most of them failed to achieve security in parallel to computational efficiency. Recently, Shin et al. and Wen et al. separately proposed two efficient authentication schemes for roaming service in ubiquitous networks. Both argued their schemes to satisfy all the security requirements for such systems. However, in this paper, we show that Shin et al.'s scheme is susceptible to: (i) user traceability; (ii) user impersonation; (iii) service provider impersonation attacks; and (iv) session key disclosure. Furthermore, we show that Wen et al.'s scheme is also insecure against: (i) session key disclosure; and (ii) known session key attacks. To conquer the security problems, we propose an improved authentication scheme with anonymity for consumer roaming in ubiquitous networks. The proposed scheme not only improved the security but also retained a lower computational cost as compared with existing schemes. We prove the security of proposed scheme in random oracle model. of 20Step 1: MN ! FA: M 1 D ¹M V 1 ; M V 2 ; M V 3 º MN inputs his identity ID MN and password P W MN . MN then computes h.ID M jjh.P W MN // and checks if the result and A MN stored in his mobile device are of 20 4 Mobile node chooses its identity ID MN , password P W MN , and a random number d . Further, MN computes f D h.ID MN kP W MN kd /. Finally, MN sends ID MN and f to the HA by using some secure channel. HA computes K MN D h.ID MN jjx/˚f using secret x. Further, HA pledges a counter ct r MN D 0 for MN and forms a record .ID MN ; ct r MN / in his database. HA then engraves the smart card (SC MN ) with K MN , ct r MN , h.:/, and n. HA issues the smart card (SC MN ) to MN. After obtaining the smart card (SC MN ), MN computes f D h.ID MN˚P W MN˚d / and writes f on SC MN . Finally, the SC MN contains ¹ct r MN ; K MN ; f ; n; d , h.:/º. Login and authentication phaseThe procedure for login and authentication is outlined in Figure 3; the same is illustrated as follows: (1) MN ! FA W M 1 . MN inserts his smart card (SC MN ) in the reader and enters his identity ID MN and password P W MN . SC MN computes f 0 D h.ID MN˚P W MN˚d / and then verifies whether f 0 D f or not. If f 0 ¤ f , the login phase terminates immediately. Otherwise, SC MN computes K MN D K MN˚h .ID MN kP W MN kd /. Then SC MN generates random n MN and computes ct r MN D ct r MN C 1 and V 1 D .ID MN jj K MN jjn MN jjct r MN jjID FA / 2 modn. Finally, MN sends the M 1 D .V 1 ; ct r MN ; ID HA / to FA.Figure 3. Wen et al.'s scheme [38]. Proposition 5 (Secure key establishment)The improved scheme provides secure key establishment. ProofAfter completion of the protocol, the MN, FA, and HA will establish a common session key SK FA D SK MN ...

show abstract

A Secure and Effective Anonymous User Authentication Scheme for Roaming Service in Global Mobility Networks

Cited by 73 publications

References 20 publications

A Privacy-Preserving Roaming Authentication Scheme for Ubiquitous Networks

A Privacy-Preserving Roaming Authentication Scheme for Ubiquitous Networks

An Efficient and Robust Anonymous Authentication Scheme in Global Mobility Networks

A lightweight anonymous authentication scheme for consumer roaming in ubiquitous networks with provable security

Contact Info

Product

Resources

About