An efficient remote user authentication scheme with strong anonymity

Liu Yanfei, Ziming Zhao, Li Hui, Luo Qun, Yang Yixian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Recently, many remote authentication schemes attempt to preserve user anonymity from the eavesdropper. However, authentication schemes in many e-commerce transactions require not only anonymous to the eavesdropper but also to the authentication server. In this paper, we propose a remote authentication scheme using smart card to fulfill both of the requirements. The proposed scheme achieves mutual authentication and allows users to choose and change their own passwords freely and securely. We only use one-way hash function and bitwise XOR operation in the proposed scheme and so the scheme has a low computational complexity. By using timestamp and random numbers, the proposed scheme can resist the denial of service attack and the replay attack. Also, the scheme is secure against guessing attack, insider attack, stolen-verifier attack, reflection attack, and impersonation attack.

Original languageEnglish (US)
Title of host publicationProceedings of the 2008 International Conference on Cyberworlds, CW 2008
Pages180-185
Number of pages6
DOIs
StatePublished - Dec 1 2008
Externally publishedYes
Event2008 International Conference on Cyberworlds, CW 2008 - Hangzhou, China
Duration: Sep 22 2008Sep 24 2008

Other

Other2008 International Conference on Cyberworlds, CW 2008
CountryChina
CityHangzhou
Period9/22/089/24/08

Fingerprint

Authentication
Smart cards
Hash functions
Computational complexity
Servers

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Vision and Pattern Recognition

Cite this

Yanfei, L., Zhao, Z., Hui, L., Qun, L., & Yixian, Y. (2008). An efficient remote user authentication scheme with strong anonymity. In Proceedings of the 2008 International Conference on Cyberworlds, CW 2008 (pp. 180-185). [4741297] https://doi.org/10.1109/CW.2008.23

An efficient remote user authentication scheme with strong anonymity. / Yanfei, Liu; Zhao, Ziming; Hui, Li; Qun, Luo; Yixian, Yang.

Proceedings of the 2008 International Conference on Cyberworlds, CW 2008. 2008. p. 180-185 4741297.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yanfei, L, Zhao, Z, Hui, L, Qun, L & Yixian, Y 2008, An efficient remote user authentication scheme with strong anonymity. in Proceedings of the 2008 International Conference on Cyberworlds, CW 2008., 4741297, pp. 180-185, 2008 International Conference on Cyberworlds, CW 2008, Hangzhou, China, 9/22/08. https://doi.org/10.1109/CW.2008.23
Yanfei L, Zhao Z, Hui L, Qun L, Yixian Y. An efficient remote user authentication scheme with strong anonymity. In Proceedings of the 2008 International Conference on Cyberworlds, CW 2008. 2008. p. 180-185. 4741297 https://doi.org/10.1109/CW.2008.23
Yanfei, Liu ; Zhao, Ziming ; Hui, Li ; Qun, Luo ; Yixian, Yang. / An efficient remote user authentication scheme with strong anonymity. Proceedings of the 2008 International Conference on Cyberworlds, CW 2008. 2008. pp. 180-185
@inproceedings{92c612567ae44971b71daef98cf0e9fe,
title = "An efficient remote user authentication scheme with strong anonymity",
abstract = "Recently, many remote authentication schemes attempt to preserve user anonymity from the eavesdropper. However, authentication schemes in many e-commerce transactions require not only anonymous to the eavesdropper but also to the authentication server. In this paper, we propose a remote authentication scheme using smart card to fulfill both of the requirements. The proposed scheme achieves mutual authentication and allows users to choose and change their own passwords freely and securely. We only use one-way hash function and bitwise XOR operation in the proposed scheme and so the scheme has a low computational complexity. By using timestamp and random numbers, the proposed scheme can resist the denial of service attack and the replay attack. Also, the scheme is secure against guessing attack, insider attack, stolen-verifier attack, reflection attack, and impersonation attack.",
author = "Liu Yanfei and Ziming Zhao and Li Hui and Luo Qun and Yang Yixian",
year = "2008",
month = "12",
day = "1",
doi = "10.1109/CW.2008.23",
language = "English (US)",
isbn = "9780769533810",
pages = "180--185",
booktitle = "Proceedings of the 2008 International Conference on Cyberworlds, CW 2008",

}

TY - GEN

T1 - An efficient remote user authentication scheme with strong anonymity

AU - Yanfei, Liu

AU - Zhao, Ziming

AU - Hui, Li

AU - Qun, Luo

AU - Yixian, Yang

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Recently, many remote authentication schemes attempt to preserve user anonymity from the eavesdropper. However, authentication schemes in many e-commerce transactions require not only anonymous to the eavesdropper but also to the authentication server. In this paper, we propose a remote authentication scheme using smart card to fulfill both of the requirements. The proposed scheme achieves mutual authentication and allows users to choose and change their own passwords freely and securely. We only use one-way hash function and bitwise XOR operation in the proposed scheme and so the scheme has a low computational complexity. By using timestamp and random numbers, the proposed scheme can resist the denial of service attack and the replay attack. Also, the scheme is secure against guessing attack, insider attack, stolen-verifier attack, reflection attack, and impersonation attack.

AB - Recently, many remote authentication schemes attempt to preserve user anonymity from the eavesdropper. However, authentication schemes in many e-commerce transactions require not only anonymous to the eavesdropper but also to the authentication server. In this paper, we propose a remote authentication scheme using smart card to fulfill both of the requirements. The proposed scheme achieves mutual authentication and allows users to choose and change their own passwords freely and securely. We only use one-way hash function and bitwise XOR operation in the proposed scheme and so the scheme has a low computational complexity. By using timestamp and random numbers, the proposed scheme can resist the denial of service attack and the replay attack. Also, the scheme is secure against guessing attack, insider attack, stolen-verifier attack, reflection attack, and impersonation attack.

UR - http://www.scopus.com/inward/record.url?scp=62949223066&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=62949223066&partnerID=8YFLogxK

U2 - 10.1109/CW.2008.23

DO - 10.1109/CW.2008.23

M3 - Conference contribution

AN - SCOPUS:62949223066

SN - 9780769533810

SP - 180

EP - 185

BT - Proceedings of the 2008 International Conference on Cyberworlds, CW 2008

ER -