A Mutual Authentication Protocol using Key Change Step by Step for RFID Systems 


Vol. 35,  No. 3, pp. 462-473, Mar.  2010


PDF
  Abstract

The RFID system has the security problem of location tracking and user privacy. In order to solve this problem, the cryptographic access method using hash function is difficult to in real applications. Because there is a limit of computing and storage capacity of Tag, but the safety is proved. The lightweight authentication methods like HB and LMAP guarantee the high efficiency, but the safety is not enough to use. In this paper, we use the AES for RFID Authentication, and solve the problem of using fixed key with key change step by step. The symmetric keys of the tag and server are changed by the random number generated by tag, reader and server successively. This could prevent the key exposure. As a result, the output of the tag and reader always changes. These key changes could make it possible to prevent eavesdropping, replay attack, location tracking and spoofing.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

K. Chung, K. Kim, S. Oh, J. Lee, Y. Park, K. Ahn, "A Mutual Authentication Protocol using Key Change Step by Step for RFID Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 3, pp. 462-473, 2010. DOI: .

[ACM Style]

Kyung-Ho Chung, Kyoung-Youl Kim, Se-Jin Oh, Jae-Kang Lee, Yong-Soo Park, and Kwang-Seon Ahn. 2010. A Mutual Authentication Protocol using Key Change Step by Step for RFID Systems. The Journal of Korean Institute of Communications and Information Sciences, 35, 3, (2010), 462-473. DOI: .

[KICS Style]

Kyung-Ho Chung, Kyoung-Youl Kim, Se-Jin Oh, Jae-Kang Lee, Yong-Soo Park, Kwang-Seon Ahn, "A Mutual Authentication Protocol using Key Change Step by Step for RFID Systems," The Journal of Korean Institute of Communications and Information Sciences, vol. 35, no. 3, pp. 462-473, 3. 2010.