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

한국통신학회논문지

An Efficient RFID Distance-Bounding Protocol to Prevent Relay Attacks

chang hee boo, Moon Seog Jun

Published Jan 1, 2010• 0 citations
OpenAlex

Abstract

RFID (radio frequency identification) systems, recently being used in a wide range of areas, are vulnerable to relay attack from malicious attackers. For that reason, Brands, et al. proposed a certification protocol between a certifier and a verifier based on the concept of distance-bounding, and in addition Hancke et al. introduced the concept of RFID. However, the delivery of tag IDs, one of the main RFID features, is not still available, and there are two important demerits: anonymity in the delivery of tag IDs suggested by Kim et al. and inefficiency in finding a tag ID with regard to how to check errors which may occur in the process of data exchange between readers and tags. Therefore, this study proposes a protocol that meets the requirements of tag anonymity and location untraceability, has resistance to errors which may take place in the phase of tag data exchange, and is very efficient in finding tag IDs.

Related papers

Authentication Protocol for RFID Systems: A Survey

Hasnae Lamrani Alaoui, Mostapha Zbakh, An Breaken +2 more

Radio Frequency Identification (RFID) is a prominent technology within the Internet of Things (IoT) ecosystem, offering efficient and reliable object identification in various domains, including business, healthcare, and manufacturing. The security of RFID systems is of paramount importance, and recent authentication protocols have been developed to address these security concerns. In this survey paper, we explore and evaluate the latest authentication protocols designed to enhance security in RFID communications, primarily concentrating on the interaction between RFID readers and tags. We critically assess contemporary lightweight RFID authentication protocols, considering aspects such as security requirements, computational efficiency, and resilience against potential attacks. However, with the advent of quantum computing, these protocols are under scrutiny for their vulnerability. As a result, we emphasize the need for researchers to shift their focus toward post-quantum cryptography solutions to bolster the security of RFID systems. This paper serves as a comprehensive overview of recent developments in RFID authentication, shedding light on the pressing need for quantum-resistant security measures in this field.

International Conference on Cloud Computing Technologies and Applications (CloudTech)•Nov 21, 2023•1 citation

On Detecting Relay Attacks on RFID Systems Using Qubits

Aysajan Abidin

As RFID technology is being widely used in access control systems to identify and track both objects and people, relay attacks on RFID systems continue to pose serious threats to security. To mitigate relay attacks, distance bounding protocols can be used. Until recently, all distance bounding protocols were based on classical cryptography and communication techniques. In this paper, we take a closer look at a recently proposed protocol by Jannati and Ardeshir-Larijani [Quantum Information Processing 2016, 18] to detect relay attacks using qubits. We first observe that the protocol has a weakness which allows an adversary to mount a successful attack on the protocol. We then propose a countermeasure to restore security and compare the fixed protocol with the state of the art.

Cryptography•May 8, 2020•3 citations

Distance-bounding for RFID: Effectiveness of ‘terrorist fraud’ in the presence of bit errors

Gerhard Petrus Hancke

Time-of-flight distance-bounding protocols are potentially useful in RFID and NFC environments and are designed to discourage a number of attacks that take advantage of the inherent assumption that a token and reader that manages to communicate are located in close physical proximity to each other. These protocols are dependent on time measurements made at the physical layer of the communication channel, and thus require special high bandwidth channels with low latency. Executing a distance-bound protocol on a suitable channel in a constrained environment would potentially allow for bit errors during communication. Currently, terrorist fraud is discouraged in distance-bounding protocols by ensuring that a prover collaborating with an the attacker in this fraud has to make his secret key known to the attacker. We discuss the effect of making a protocol resistant to bit errors and show that the approach to design protocols against terrorist fraud is significantly weakened by error resistance, as a prover is potentially able to keep his key secret or hinder an attacker from learning his key.

IEEE International Conference on RFID Technology and Applications (RFID-TA)•Nov 1, 2012•51 citations

Mutual implementation of predefined and random challenges over RFID distance bounding protocol

Hoda Jannati, Abolfazl Falahati

Distance bounding protocols are launched based upon the round trip time measurements of the carried out messages to defend RFID systems against the relay attack. In such protocols, the reader authenticates tags and also estimates an upper bound for the physical distance between the tag and itself. Distance bounding protocols are vulnerable to mafia fraud and distance fraud attacks. In this paper, a new distance bounding protocol is proposed based on mutual utilization of binary predefined and random challenges. Moreover, this protocol is analyzed to compute the attacker's success probability due to mafia fraud and distance fraud attacks. In this case, the analysis and simulation results show that the proposed protocol obtains the desirable attackers' success probabilities, with minimum system memory requirement and minimum number of rounds compared with other distance bounding protocols employed by RFID systems.

International ISC Conference on Information Security and Cryptology (ISCISC)•Sep 1, 2012•14 citations

An Efficient Single-Slow-Phase Mutually Authenticated RFID Distance Bounding Protocol with Tag Privacy

Anjia Yang, Yunhui Zhuang, Duncan S. Wong

Lecture notes in computer science•Jan 1, 2012•21 citations

Security of RFID Protocols – A Case Study

Ton van Deursen, Saša Radomirović

In the context of Dolev-Yao style analysis of security protocols, we investigate the security claims of a recently proposed RFID authentication protocol. We exhibit a flaw which has gone unnoticed in RFID protocol literature and present the resulting attacks on authentication, untraceability, and desynchronization resistance. We analyze and discuss the authors' proofs of security. References to other vulnerable protocols are given.

Electronic Notes in Theoretical Computer Science•Jul 31, 2009•25 citations
RFID (radio frequency identification) systems, recently being used in a wide range of areas, are vulnerable to relay attack from malicious attackers. For that reason, Brands, et al. proposed a certification protocol between a certifier and a verifier based on the concept of distance-bounding, and in addition Hancke et al. introduced the concept of RFID. However, the delivery of tag IDs, one of the main RFID features, is not still available, and there are two important demerits: anonymity in the delivery of tag IDs suggested by Kim et al. and inefficiency in finding a tag ID with regard to how to check errors which may occur in the process of data exchange between readers and tags. Therefore, this study proposes a protocol that meets the requirements of tag anonymity and location untraceability, has resistance to errors which may take place in the phase of tag data exchange, and is very efficient in finding tag IDs.
Radio Frequency Identification (RFID) is a prominent technology within the Internet of Things (IoT) ecosystem, offering efficient and reliable object identification in various domains, including business, healthcare, and manufacturing. The security of RFID systems is of paramount importance, and recent authentication protocols have been developed to address these security concerns. In this survey paper, we explore and evaluate the latest authentication protocols designed to enhance security in RFID communications, primarily concentrating on the interaction between RFID readers and tags. We critically assess contemporary lightweight RFID authentication protocols, considering aspects such as security requirements, computational efficiency, and resilience against potential attacks. However, with the advent of quantum computing, these protocols are under scrutiny for their vulnerability. As a result, we emphasize the need for researchers to shift their focus toward post-quantum cryptography solutions to bolster the security of RFID systems. This paper serves as a comprehensive overview of recent developments in RFID authentication, shedding light on the pressing need for quantum-resistant security measures in this field.
As RFID technology is being widely used in access control systems to identify and track both objects and people, relay attacks on RFID systems continue to pose serious threats to security. To mitigate relay attacks, distance bounding protocols can be used. Until recently, all distance bounding protocols were based on classical cryptography and communication techniques. In this paper, we take a closer look at a recently proposed protocol by Jannati and Ardeshir-Larijani [Quantum Information Processing 2016, 18] to detect relay attacks using qubits. We first observe that the protocol has a weakness which allows an adversary to mount a successful attack on the protocol. We then propose a countermeasure to restore security and compare the fixed protocol with the state of the art.
Time-of-flight distance-bounding protocols are potentially useful in RFID and NFC environments and are designed to discourage a number of attacks that take advantage of the inherent assumption that a token and reader that manages to communicate are located in close physical proximity to each other. These protocols are dependent on time measurements made at the physical layer of the communication channel, and thus require special high bandwidth channels with low latency. Executing a distance-bound protocol on a suitable channel in a constrained environment would potentially allow for bit errors during communication. Currently, terrorist fraud is discouraged in distance-bounding protocols by ensuring that a prover collaborating with an the attacker in this fraud has to make his secret key known to the attacker. We discuss the effect of making a protocol resistant to bit errors and show that the approach to design protocols against terrorist fraud is significantly weakened by error resistance, as a prover is potentially able to keep his key secret or hinder an attacker from learning his key.
Distance bounding protocols are launched based upon the round trip time measurements of the carried out messages to defend RFID systems against the relay attack. In such protocols, the reader authenticates tags and also estimates an upper bound for the physical distance between the tag and itself. Distance bounding protocols are vulnerable to mafia fraud and distance fraud attacks. In this paper, a new distance bounding protocol is proposed based on mutual utilization of binary predefined and random challenges. Moreover, this protocol is analyzed to compute the attacker's success probability due to mafia fraud and distance fraud attacks. In this case, the analysis and simulation results show that the proposed protocol obtains the desirable attackers' success probabilities, with minimum system memory requirement and minimum number of rounds compared with other distance bounding protocols employed by RFID systems.