A Pairing-Based User Authentication Scheme for Wireless Clients with Smart Cards

Abstract

With rapid growth of mobile wireless networks, handheld devices are popularly used by people and many mobile applications have been rapidly developed. Considering the limited computing capability of smart cards or mobile devices, the security scheme design suitable for these mobile devices is a nontrivial challenge. A user authentication scheme is a mechanism to authenticate a remote user over an open network. In 2006, Das et al. proposed an identity (ID)based remote user authentication scheme with smart cards using bilinear pairings. Unfortunately, their scheme is insecure against forgery attack. Recently, Giri and Srivastava proposed an improved scheme to overcome the forgery attack. The computational cost required by the Giri-Srivastava scheme is expensive, especially for smart cards with limited computing capability. In addition, the Giri-Srivastava scheme is unable to be used for a multi-server environment. This paper presents an efficient and secure ID-based remote user authentication scheme using bilinear pairings. Based on the computational Diffie-Hellman assumption, we show that the proposed scheme is secure against existential forgery on adaptively chosen-message and ID attack in the random oracle model. As compared with the recently proposed pairing-based authentication schemes, our scheme has better performance in term of the computational cost and it is suitable for a multi-server environment in distributed networks. Performance analysis and experimental data of related pairing operations on smartcards are given to demonstrate that our scheme is well suited for mobile devices with limited computing capability.

An enhanced bilinear pairing based authenticated key agreement protocol for multiserver environment

“…From Table 1, it is noticeable that the schemes 10-12,21,23,29-31 do not sustain user anonymity; further, the protocols 10-12,21,23,24,29-31 do not withstand impersonation attack. Also, the schemes 12,21,24,29,30 fail to withstand many security threats which include mutual authentication and key establishment. In terms of providing security features, our scheme outperforms other related schemes.…”

“…The computational complexity of our scheme is compared with that of some related schemes. 10,11,[29][30][31]50 The registration process is a 1-time process in the authentication protocol. So, comparison of the complexity of executing each operation is performed only for the login and authentication phases.…”

User authentication scheme preserving anonymity for ubiquitous devices

“…But, like Tseng et al [20], the scheme required time synchronization to protect from replay attack. Unfortunately, Liao and Hsiao [24] pointed out that the scheme of Tseng et al [19] also lacked mutual authentication with session key agreement, suffered from insider attack, password guessing attack, and replay attack, and advanced a pairings-based user authentication scheme using self-certified public keys. Liao and Hsiao claimed that their proposal could withstand various possible attacks and was well suited for multiserver environment Others several ID-based authentication protocols on elliptic curve cryptosystem (ECC) are proposed.…”

Further analysis of pairing‐based traitor tracing schemes for broadcast encryption

“…Here, we briefly review the concept of bilinear pairings. For the details of bilinear pairings, readers can refer to [11][12][13][14] for a full description. Let G 1 and G 2 be two multiplicative cyclic groups with the same large prime order q.…”