• Corpus ID: 2819662

An Asymptotically Optimal RFID Authentication Protocol Against Relay Attacks

  title={An Asymptotically Optimal RFID Authentication Protocol Against Relay Attacks},
  author={Gildas Avoine and Aslan Tchamkerten},
Relay attacks are a major concern for RFID systems: during an authentication process an adversary transparently relays messages between a verifier and a remote legitimate prover. We present an authentication protocol suited for RFID systems. Our solution is the first that prevents relay attacks without degrading the authentication security level: it minimizes the probability that the verifier accepts a fake proof of identity, whether or not a relay attack occurs. 

Figures from this paper

An Enhanced RFID Mutual Authentication Protocol based on Quantum Dynamic Basis
A novel quantum dynamic basis theory is applied to RFID system to detect relay attacks and it is argued that this protocol improve the security and reduce the computational cost for identifying a tag.
Chaos Based RFID Authentication Protocol
The result is a computationally efficient and cryptographically complex new RFID authentication scheme that can be readily adopted in current RFID standards such as ISO-14443 and ISO-15693.
Signals , Information , and Algorithms
Introduction Our laboratory formulates, examines, and develops algorithmic solutions to a wide spectrum of problems of fundamental interest involving the manipulation of signals and information in


RFID Distance Bounding Protocols
A modified distance bounding protocol is presented and evaluated that aims to address the vulnerability of RFID tag/reader authentication protocols to mafia attacks and/or terrorist attacks from adversaries.
An RFID Distance Bounding Protocol
  • G. Hancke, M. Kuhn
  • Computer Science
    First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05)
  • 2005
A new distance-bounding protocol based on ultra-wideband pulse communication is proposed, aimed at being implementable using only simple, asynchronous, low-power hardware in the token, particularly well suited for use in passive low-cost tokens, noisy environments and high-speed applications.
Detecting relay attacks with timing-based protocols
This paper presents the first symmetric key based distance-bounding protocol that is also resistant to so-called terrorist fraud, a variant of mafia fraud, and presents experimental results to support the arguments.
A Note on the Relay Attacks on e-passports: The Case of Czech e-passports
Experimental observations concerning Czech e-passports show clearly an inherent weakness rooted in lower layers of ISO 14443, which induces a question on whether the e- passport should not have used a dierent communication protocol or authentication scheme.
Distance Bounding in Noisy Environments
An improved distance bounding protocol for noisy channels that offers a substantial reduction in the number of communication rounds compared to the Hancke and Kuhn protocol and uses binary codes to correct bit errors occurring during the fast bit exchanges.
Distance Bounding Protocols: Authentication Logic Analysis and Collusion Attacks
The first full-scale formal analysis of a distance bounding protocol is given, and it is shown how this analysis helps to reduce message and cryptographic complexity without reducing security.
SECTOR: secure tracking of node encounters in multi-hop wireless networks
SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks, is presented and it is shown that, due to their efficiency and simplicity, they are compliant with the limited resources of most mobile devices.
Secure positioning in wireless networks
This paper proposes a mechanism for secure positioning of wireless devices, that is verifiable multilateration, and shows how this mechanism can be used to secure positioning in sensor networks.
Identification Tokens - or: Solving the Chess Grandmaster Problem
A solution against real time attacks in which active eavesdroppers relay questions and answers or the prover helps deliberately an impersonator is given and it is proved that the solution protects against the real-time attacks.
Distance-Bounding Protocols (Extended Abstract)
The "distance bounding" technique is introduced, which solves the problem of timing the delay between sending out a challenge bit and receiving back the corresponding response bit and can be integrated into common identification protocols.