Anonymous authentication protocol based on elliptic curve Diffie-Hellman for wireless access networks

Abstract

Anonymous channel tickets have been proposed as a way to provide user anonymity and to reduce the overhead of re‐authentication for authentication in wireless environments. Chen et al. proposed a secure and efficient protocol, based on a protocol proposed by Yang et al., which is resistant to guessing attacks on networks from which users’ secret keys are easy to obtain. However, their scheme is time‐consuming in the phases of ticket issuing and authentication. Furthermore, a malicious attacker can utilize the expired time, Texp, to launch a denial of authentication (DoA) attack, which is a type of denial of service attack. Because Texp is exposed to any user, it would be easy to launch a DoA attack that could make the scheme impractical. To resist against DoAs that the scheme of Chen et al. might suffer, we propose an improved scheme based on elliptic curve cryptography in this paper. Our scheme not only reduces time cost but also enhances security. The basis of the proposed scheme is the elliptic curve discrete logarithm problem. The operations of points of an elliptic curve are faster and use fewer bits to achieve the same level of security. Therefore, our scheme is more suitable for mobile devices, which have limited computing power and storage. Copyright © 2012 John Wiley & Sons, Ltd.

On the Security of a Two-Factor Authentication and Key Agreement Scheme for Telecare Medicine Information Systems

“…As reported in [31,32] the average execution time of a modular exponentiation, an elliptic curve point multiplication and a hash function operation is 522 ms, 63.075 ms, and 0.5 ms, respectively. Moreover, it is assumed that the time of performing an exclusive-or operation is negligible.…”

“…In order to provide a precise performance comparison, the experiment data reported in [31,32] are used. As reported in [31,32] the average execution time of a modular exponentiation, an elliptic curve point multiplication and a hash function operation is 522 ms, 63.075 ms, and 0.5 ms, respectively.…”

A practical anonymous authentication protocol for wireless roaming

“…The Hsieh–Leu protocol consists of three phases: (i) registration; (ii) ticket issuing; and (iii) session key update. The notations used in this paper are presented in the succeeding texts.…”

“…After that, Youn et al showed that the protocol proposed in is not anonymous, and Mun et al showed that the protocol in achieves neither anonymity nor perfect forward secrecy , which is an important property in practice. In 2011, Chen et al proposed another efficient protocol secure against password guessing attack, but very recently, Hsieh and Leu showed that the protocol is vulnerable to denial of authentication attack, which is a special type of denial of service attack. Hsieh and Leu also proposed an improved scheme to overcome the weakness.…”

“…In 2011, Chen et al proposed another efficient protocol secure against password guessing attack, but very recently, Hsieh and Leu showed that the protocol is vulnerable to denial of authentication attack, which is a special type of denial of service attack. Hsieh and Leu also proposed an improved scheme to overcome the weakness.…”