An RFID Distance Bounding Protocol

@article{Hancke2005AnRD,
  title={An RFID Distance Bounding Protocol},
  author={Gerhard Petrus Hancke and Markus G. Kuhn},
  journal={First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05)},
  year={2005},
  pages={67-73}
}
  • G. Hancke, M. Kuhn
  • Published 5 September 2005
  • Computer Science
  • First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05)
Radio-frequency identification tokens, such as contactless smartcards, are vulnerable to relay attacks if they are used for proximity authentication. Attackers can circumvent the limited range of the radio channel using transponders that forward exchanged signals over larger distances. Cryptographic distance-bounding protocols that measure accurately the round-trip delay of the radio signal provide a possible countermeasure. They infer an upper bound for the distance between the reader and the… 
Distance-Bounding Protocol with Time-Stamped Authentication for RFID
TLDR
An effective attack of a family of distance bounding protocols is provided to implement the spoofing attacks of distance successfully, and description of existing protocols cannot completely eliminate such attacks.
Distance-Bounding Protocol with Time-Stamped Authentication for RFID
TLDR
An effective attack of a family of distance bounding protocols is provided to implement the spoofing attacks of distance successfully, and description of existing protocols cannot completely eliminate such attacks.
RFID Distance Bounding Multistate Enhancement ( Short Version )
TLDR
A generic technique called MUltiState Enhancement that is based on a more efficient use of void challenges called MUSE significantly improves the performances of the already-published distance bounding protocols and extends the void challenges to p-symbols.
Attacks on time-of-flight distance bounding channels
TLDR
It is concluded that conventional RF channels can be problematic for secure distance- bounding implementations and the merits and weaknesses of special distance-bounding channels that have been proposed for RFID applications are discussed.
RFID Distance Bounding Multistate Enhancement
TLDR
A generic technique called MUltiState Enhancement that is based on a more efficient use of void challenges that significantly improves the performances of the already-published distance bounding protocols and extends the void challenges to p-symbols.
Design of a secure distance-bounding channel for RFID
  • G. Hancke
  • Computer Science
    J. Netw. Comput. Appl.
  • 2011
Distance bounding protocols for RFID enhanced by using void-challenges and analysis in noisy channels
TLDR
This paper considers a modification of RFID protocols using the most popular of this kind of protocols, the Hancke and Kuhn's protocol, to show the improvements achieved when different cases are analysed.
A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions
TLDR
A strong adversary model for Physically Unclonable Functions (PUFs) based authentication protocol in which the adversary has access to volatile memory of the tag is introduced and it is proved that the ideal security against all those frauds, remarkably the terrorist fraud.
A new relay attack on distance bounding protocols and its solution with time-stamped authentication for RFID
TLDR
An effective attack is designed against a family of distance bounding protocols to launch the spoofing attacks within effective distance successfully, which demonstrates that existing protocols cannot eliminate such attacks completely.
A mafia and distance fraud high-resistance RFID distance bounding protocol
TLDR
A unilateral DB protocol using delay concept while sending two random binary challenges can resist better than other unilateral DB protocols against mafia and distance fraud attacks and can be applied to passive RFID tags.
...
...

References

SHOWING 1-10 OF 33 REFERENCES
Distance-Bounding Protocols (Extended Abstract)
TLDR
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.
SECTOR: secure tracking of node encounters in multi-hop wireless networks
TLDR
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.
A Practical Relay Attack on ISO 14443 Proximity Cards
TLDR
An attack which effectively allows an attacker to 'borrow' the victim's card for a short period without requir- ing physical access to the victim’s card, so that the legitimate owner will remain unaware of the attack.
An Asymmetric Security Mechanism for Navigation Signals
  • M. Kuhn
  • Computer Science
    Information Hiding
  • 2004
TLDR
This paper introduces a practical solution based on short-term information hiding based on digital signatures for signal-integrity (anti-spoof) protection in navigation services, especially not with systems for remote attestation of location.
Enhancing RFID Privacy via Antenna Energy Analysis
TLDR
It is proposed that a key aspect of RFID communication with passive tags, namely its required energy transference from an external antenna, may offer previously unexamined promise when developing privacy mechanisms.
Secure verification of location claims
TLDR
The Echo protocol is extremely lightweight: it does not require time synchronization, cryptography, or very precise clocks, and it is believed that it is well suited for use in small, cheap, mobile devices.
Embedding Distance-Bounding Protocols within Intuitive Interactions
TLDR
A drag-and-drop interaction paradigm is described that enables strong authentication by embedding such a protocol within personal authentication tokens and can be used as the basis for performing user-friendly pervasive multi-party secure interactions.
Secure positioning of wireless devices with application to sensor networks
  • Srdjan Capkun, J. Hubaux
  • Computer Science
    Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.
  • 2005
TLDR
This work 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.
Context-Aware User Authentication - Supporting Proximity-Based Login in Pervasive Computing
TLDR
A context-aware user authentication protocol, which uses a JavaCard for identification and cryptographic calculations, uses a context-awareness system for verifying the user’s location, and implements a security fall-back strategy.
LOCADIO: inferring motion and location from Wi-Fi signal strengths
  • John Krumm, E. Horvitz
  • Computer Science
    The First Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, 2004. MOBIQUITOUS 2004.
  • 2004
TLDR
The probabilistic approach to inferring context gives a convenient way of balancing noisy measured data such as signal strengths against the authors' a priori assumptions about a user's behavior.
...
...