Robust Matrix-based RFID Mutual Authentication Protocol 


Vol. 33,  No. 11, pp. 883-891, Nov.  2008


PDF
  Abstract

In 2006, Lee and Ahn proposed a matrix-based RFID authentication protocol which eliminates the security problems in HB and HB+ RFID authentication protocols. Their proposed protocol provides the following three merits: (1) it reduces the computational costs of the RFID tag. (2) it reduces the communication overhead between the reader and the tag. (3) it protects the user privacy. However, this paper points out that Lee and Ahn's proposed protocol is insecure to various attacks because it does not provide mutual authentication which the RFID tag does not authenticate the legality of the RFID reader unlike their claims. In addition, this paper proposes an improved matrix-based RFID mutual authentication protocol that can provide the mutual authentication. As a result, the proposed protocol not only can provide strong security and but also guarantee high efficiency because it reduces the communication rounds compare with Lee-Ahn's protocol.

  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]

E. Yoon, K. Ha, K. Yoo, "Robust Matrix-based RFID Mutual Authentication Protocol," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 11, pp. 883-891, 2008. DOI: .

[ACM Style]

Eun-Jun Yoon, Kyeoung-Ju Ha, and Kee-Young Yoo. 2008. Robust Matrix-based RFID Mutual Authentication Protocol. The Journal of Korean Institute of Communications and Information Sciences, 33, 11, (2008), 883-891. DOI: .

[KICS Style]

Eun-Jun Yoon, Kyeoung-Ju Ha, Kee-Young Yoo, "Robust Matrix-based RFID Mutual Authentication Protocol," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 11, pp. 883-891, 11. 2008.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880