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

International Conference on E-Business and E-Government

A Mutual Authentication Protocol for Two RFID Tags

Hua Jiang, Linsen Li, Zehua Chen, Suming Fu

Published May 11, 2012• 0 citations
Publisher

Abstract

RFID has obtained great development in many areas, but its security and privacy also faced great threats. In this paper, we preset an offline authentication security protocol based on the Yoking Proof protocol. Our goal is to make the Yoking Proof become more secure. It utilizes the Hash function and random number to authenticate tags' legitimate identifications which proofs against well-known attacks effectively.

DOI
10.1109/icee.2012.1022

Related papers

An RFID Mutual Authentication Protocol Based on Tag Grouping

Zhang Xue-ju

Explore the tag grouping field less involved in current RFID security authentication protocol,Yoking Proof protocol's security problems are analyzed. An RFID M utual Authentication protocol based on Tag Grouping( M ATG) was proposed. The same tags are grouped by M ATG,reader can select a group of tags in the mutual authentication process,and then identify targets automatically in a protocol processing. Safety of the proposed protocol is analyzed and proved with the BAN logic,and then attack simulation is performed using C programming language. Theoretic analysis and simulation results show that M ATG protocol overcomes Yoking Proof protocol's shortcomings and improves working efficiency and safety when dealing with a group of tags.

Computer Technology and Development•Jan 1, 2015•0 citations

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

An RFID Grouping-proof Protocol with Privacy Protection and Forward Security

SHI Zhicai, WANG Yihan, ZHANG Xiaomei, CHEN Jiwei, CHEN Shanshan

The Radio Frequency Identification(RFID) grouping-proof protocol is used to verify whether there are multiple tags,because in actual scenario,these tags are used for the identification of one object.However,due to the simple structure and limited computing and storage resources of the RFID tags,the security protocol is difficult to achieve.To address this problem,this paper proposes a grouping-proof protocol that insures privacy and forward security.First,this paper uses hash function and randomization to guarantee the confidentiality and privacy of each session.Then,by means of activate-sleep mechanism,filter-response mechanism and the combination of identity authentication and grouping-proof technology,the efficiency of protocol is improved.Analysis results show that the RFID grouping-proof protocol meets the requirements of anonymity and forward security,so it can prevent eavesdropping,tracking attack,replay attack and de-synchronize attack.

•Jan 1, 2020•0 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

Robust Matrix-based RFID Mutual Authentication Protocol

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

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.

한국통신학회논문지•Jan 1, 2008•0 citations

Design and Analysis of RFID Mutual Authentication Protocol

Zhang Wenl

In order to content with the security requirements of RFID system,the study uses mathematic and cryptography methods to solve these problems.Considering the security,privacy and effectiveness of RFID protocol,the paper researches the authentication protocol of the RFID system and proposes a mutual authentication protocol of RFID.Its safety and performance analysis show that the proposed protocol is relatively good in these aspects.It can prevent many security including contents privacy,location tracing,replay attack,spoofing attack,and also has forward security ability.

Intelligent Computer and Applications•Jan 1, 2013•0 citations
RFID has obtained great development in many areas, but its security and privacy also faced great threats. In this paper, we preset an offline authentication security protocol based on the Yoking Proof protocol. Our goal is to make the Yoking Proof become more secure. It utilizes the Hash function and random number to authenticate tags' legitimate identifications which proofs against well-known attacks effectively.
Explore the tag grouping field less involved in current RFID security authentication protocol,Yoking Proof protocol's security problems are analyzed. An RFID M utual Authentication protocol based on Tag Grouping( M ATG) was proposed. The same tags are grouped by M ATG,reader can select a group of tags in the mutual authentication process,and then identify targets automatically in a protocol processing. Safety of the proposed protocol is analyzed and proved with the BAN logic,and then attack simulation is performed using C programming language. Theoretic analysis and simulation results show that M ATG protocol overcomes Yoking Proof protocol's shortcomings and improves working efficiency and safety when dealing with a group of tags.
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.
The Radio Frequency Identification(RFID) grouping-proof protocol is used to verify whether there are multiple tags,because in actual scenario,these tags are used for the identification of one object.However,due to the simple structure and limited computing and storage resources of the RFID tags,the security protocol is difficult to achieve.To address this problem,this paper proposes a grouping-proof protocol that insures privacy and forward security.First,this paper uses hash function and randomization to guarantee the confidentiality and privacy of each session.Then,by means of activate-sleep mechanism,filter-response mechanism and the combination of identity authentication and grouping-proof technology,the efficiency of protocol is improved.Analysis results show that the RFID grouping-proof protocol meets the requirements of anonymity and forward security,so it can prevent eavesdropping,tracking attack,replay attack and de-synchronize attack.
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.
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 content with the security requirements of RFID system,the study uses mathematic and cryptography methods to solve these problems.Considering the security,privacy and effectiveness of RFID protocol,the paper researches the authentication protocol of the RFID system and proposes a mutual authentication protocol of RFID.Its safety and performance analysis show that the proposed protocol is relatively good in these aspects.It can prevent many security including contents privacy,location tracing,replay attack,spoofing attack,and also has forward security ability.