Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

한국통신학회논문지

Robust Matrix-based RFID Mutual Authentication Protocol

Eun‐Jun Yoon, Kyeoung-Ju Ha, Kee-Young Yoo

Published Jan 1, 2008• 0 citations
OpenAlex

Abstract

In 2006, Lee and Ahn proposed a matrix-based RFID authentication protocol which eliminates the security problems in HB and 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.

Related papers

Design and analysis of the light-weight mutual authentication protocol for RFID

Huixian Li

In order to solve the weakness in security and privacy and the poor performance of the existing RFID authentication protocols,a Hash-based mutual authentication protocol for RFID is proposed and its security is proved by using the provable security model,with the privacy and security features of the proposed protocol analyzed.Compared with several RFID authentication protocols with the similar structure,the proposed protocol can effectively solve the privacy and security issues of the RFID system and has significant performance advantages,because it greatly reduces the amount of storage and computation of tags,and particularly improves the search efficiency of the server database.

Journal of Xidian University•Jan 1, 2012•5 citations

Design of a Mutual Authentication Protocol for RFID Based on ECC

Hongyan Kang

A low-cost, efficient and safe mutual authentication protocol for RFID based on elliptic curve cryptography (ECC) is proposed, specific to the security and privacy problem existed in the existing RFID authentication protocol, on the basis of deep analysis of the existing RFID protocol based on ECC.As to this proposal, mutual authentication between the tag and reader can be realized only through two sessions, under the condition of not destroying the security strength.So, the workload of calculation and system resource expense are reduced.The paper has described the protocol in detail and analyzed its security.The analysis result shows that, the protocol can resist tracking attack, replay attack, man-in-themiddle attack and other attacks, has good forward security and can realize mutual authentication between the server and the tag.Besides, it has definite practicability, due to low cost, security and scalability.

The Open Automation and Control Systems Journal•Sep 30, 2015•3 citations

HB Family RFID Mutual Authentication Protocol

Chia-Min Lin, Shyh-Chang Tsaur, Yeong-Chin Chen +1 more

RFID security protocol is widely discussed as an important issue, while the mutual authentication with the security agreement is mostly discussed enthusiastically. In this paper we improve HB family to achieve the property of mutual authentication, so that the user privacy can be protected. The future direction is to adapt the protocol for cloud computing.

International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP)•Oct 1, 2011•3 citations

An Enhanced Mutual Key Agreement Protocol for Mobile RFID-enabled Devices

Kambombo Mtoga, Eun‐Jun Yoon

Mobile RFID is a new application that uses a mobile phone as an RFID reader with wireless technology and provides a new valuable service to users by integrating RFID and ubiquitous sensor network infrastructures with mobile communication and wireless Internet. Whereas the mobile RFID system has many advantages, privacy violation problems on the reader side are very concerning to individuals and researchers. Unlike in regular RFID environments, where the communication channel between the server and reader is assumed to be secure, the communication channel between the backend server and the RFID reader in the mobile RFID system is not assumed to be safe. Therefore it has become necessary to devise a new communication protocol that secures the privacy of mobile RFID-enabled devices. Recently, Lo et al. proposed a mutual key agreement protocol that secures the authenticity and privacy of engaged mobile RFID readers by constructing a secure session key between the reader and server. However, this paper shows that this protocol does not meet all of the necessary security requirements. Therefore we developed an enhanced mutual key agreement protocol for mobile RFID-enabled devices that alleviates these concerns. We further show that our protocol can enhance data security and provide privacy protection for the reader in an unsecured mobile RFID environment, even in the presence of an active adversary.

IEIE Transactions on Smart Processing and Computing•Aug 1, 2012•6 citations

A New Strong Adversary Model for RFID Authentication Protocols

Mehdi Hosseinzadeh, Jan Lánský, Amir Masoud Rahmani +4 more

Radio Frequency Identification (RFID) systems represent a key technology for ubiquitous computing and for the deployment of the Internet of Things (IoT). In RFID technology, authentication protocols are often necessary in order to confirm the identity of the parties involved (i.e. RFID readers, RFID tags and/or database servers). In this article, we analyze the security of a mutual authentication protocol proposed by Wang and Ma. Our security analysis clearly shows major security pitfalls in this protocol. Firstly, we show two approaches that an adversary may use to mislead an honest reader into thinking that it is communicating with a legitimate database. Secondly, we show how an adversary that has compromised some tags can impersonate an RFID reader to a legitimate database. Furthermore, we present a new adversary model, which pays heed on cases missed by previous proposals. In contrast to previous models where the communication between an RFID reader and a back-end server is through a secure channel, our model facilitates the security analysis of more general schemes where this communication channel (RFID reader-to-server) is insecure. This model determines whether the compromise of RFID tags has any impact on the security of the reader-to-server communication or vice versa. In a secure protocol, the possible compromise of RFID tags should not affect the RFID reader-server communication. In this paper, we show that compromising of RFID tags in Wang and Ma protocol has a direct impact on the reader-server security. Finally, we propose a new authentication protocol that offers an adequate security level and is resistant against the mentioned security risks. The security proofs of the proposed protocol are supported with Gong-Needham-Yahalom (GNY) logic and Scyther tool, which are formal methods to evaluate the security of a cryptographic protocol.

IEEE Access•Jan 1, 2020•19 citations

RFID Mutual Authentication Protocol and Performance Analysis

Wang Tu

As for so many security vulnerabilities, such as readers' ID-disclosure attack, man-in-the-middle attack, spoofing attack in Yao's authentication protocol, we propose a Radio Frequency Identification mutual authentication protocol based on NTRU public key encryption system, and perform formal analysis with GNY logic. The protocol not only has character of once a secret, but also the session key exchanged when mutual authentication protocol completed.Main computing tasks is implemented on the readers, so the pressure of server can be reduced effectively, the position tracking and forward security issues exist in current protocols can be solved as well. Analytic result shows that the proposed mutual authentication protocol can resist replay attack, counterfeit attack, denial of service attacks and other malicious attacks,and has featuresof low computational complexity,little communication,high efficiency. It is suitable for apply this protocol in low-cost tags.

Journal of Chengdu University of Information Technology•Jan 1, 2013•0 citations
In 2006, Lee and Ahn proposed a matrix-based RFID authentication protocol which eliminates the security problems in HB and 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.
In order to solve the weakness in security and privacy and the poor performance of the existing RFID authentication protocols,a Hash-based mutual authentication protocol for RFID is proposed and its security is proved by using the provable security model,with the privacy and security features of the proposed protocol analyzed.Compared with several RFID authentication protocols with the similar structure,the proposed protocol can effectively solve the privacy and security issues of the RFID system and has significant performance advantages,because it greatly reduces the amount of storage and computation of tags,and particularly improves the search efficiency of the server database.
A low-cost, efficient and safe mutual authentication protocol for RFID based on elliptic curve cryptography (ECC) is proposed, specific to the security and privacy problem existed in the existing RFID authentication protocol, on the basis of deep analysis of the existing RFID protocol based on ECC.As to this proposal, mutual authentication between the tag and reader can be realized only through two sessions, under the condition of not destroying the security strength.So, the workload of calculation and system resource expense are reduced.The paper has described the protocol in detail and analyzed its security.The analysis result shows that, the protocol can resist tracking attack, replay attack, man-in-themiddle attack and other attacks, has good forward security and can realize mutual authentication between the server and the tag.Besides, it has definite practicability, due to low cost, security and scalability.
Mobile RFID is a new application that uses a mobile phone as an RFID reader with wireless technology and provides a new valuable service to users by integrating RFID and ubiquitous sensor network infrastructures with mobile communication and wireless Internet. Whereas the mobile RFID system has many advantages, privacy violation problems on the reader side are very concerning to individuals and researchers. Unlike in regular RFID environments, where the communication channel between the server and reader is assumed to be secure, the communication channel between the backend server and the RFID reader in the mobile RFID system is not assumed to be safe. Therefore it has become necessary to devise a new communication protocol that secures the privacy of mobile RFID-enabled devices. Recently, Lo et al. proposed a mutual key agreement protocol that secures the authenticity and privacy of engaged mobile RFID readers by constructing a secure session key between the reader and server. However, this paper shows that this protocol does not meet all of the necessary security requirements. Therefore we developed an enhanced mutual key agreement protocol for mobile RFID-enabled devices that alleviates these concerns. We further show that our protocol can enhance data security and provide privacy protection for the reader in an unsecured mobile RFID environment, even in the presence of an active adversary.
Radio Frequency Identification (RFID) systems represent a key technology for ubiquitous computing and for the deployment of the Internet of Things (IoT). In RFID technology, authentication protocols are often necessary in order to confirm the identity of the parties involved (i.e. RFID readers, RFID tags and/or database servers). In this article, we analyze the security of a mutual authentication protocol proposed by Wang and Ma. Our security analysis clearly shows major security pitfalls in this protocol. Firstly, we show two approaches that an adversary may use to mislead an honest reader into thinking that it is communicating with a legitimate database. Secondly, we show how an adversary that has compromised some tags can impersonate an RFID reader to a legitimate database. Furthermore, we present a new adversary model, which pays heed on cases missed by previous proposals. In contrast to previous models where the communication between an RFID reader and a back-end server is through a secure channel, our model facilitates the security analysis of more general schemes where this communication channel (RFID reader-to-server) is insecure. This model determines whether the compromise of RFID tags has any impact on the security of the reader-to-server communication or vice versa. In a secure protocol, the possible compromise of RFID tags should not affect the RFID reader-server communication. In this paper, we show that compromising of RFID tags in Wang and Ma protocol has a direct impact on the reader-server security. Finally, we propose a new authentication protocol that offers an adequate security level and is resistant against the mentioned security risks. The security proofs of the proposed protocol are supported with Gong-Needham-Yahalom (GNY) logic and Scyther tool, which are formal methods to evaluate the security of a cryptographic protocol.
As for so many security vulnerabilities, such as readers' ID-disclosure attack, man-in-the-middle attack, spoofing attack in Yao's authentication protocol, we propose a Radio Frequency Identification mutual authentication protocol based on NTRU public key encryption system, and perform formal analysis with GNY logic. The protocol not only has character of once a secret, but also the session key exchanged when mutual authentication protocol completed.Main computing tasks is implemented on the readers, so the pressure of server can be reduced effectively, the position tracking and forward security issues exist in current protocols can be solved as well. Analytic result shows that the proposed mutual authentication protocol can resist replay attack, counterfeit attack, denial of service attacks and other malicious attacks,and has featuresof low computational complexity,little communication,high efficiency. It is suitable for apply this protocol in low-cost tags.