Distance-bounding protocol
From Wikipedia, the free encyclopedia
In computer security, a distance-bounding protocol is a cryptographic protocol that establishes an upper bound for the distance between two communicating parties. Distance-bounding protocols are specialized entity-authentication protocols designed such that the round-trip delay time of a challenge-response exchange can be measured accurately and is protected against manipulation. The distance across which such an exchange has been performed cannot be longer than the measured round-trip delay divided into twice the speed of light, the fastest speed at which information can propagate through space.
[edit] References
- Stefan Brands, David Chaum: Distance-bounding protocols (extended abstract). Proceedings Eurocrypt '93.
- Srdjan Capkun, Levente Buttyán and Jean-Pierre Hubaux, SECTOR: Secure Tracking of Node Encounters in Multi-hop Wireless Networks. Proceedings of the ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), 2003.
- Gerhard Hancke, Markus Kuhn: An RFID distance-bounding protocol. Proceedings SecureComm 2005.
- Srdjan Capkun, Jean-Pierre Hubaux, Secure positioning in wireless networks, IEEE Journal on Selected Areas in Communications: Special Issue on Security in Wireless Ad Hoc Networks, February 2006
 |
This cryptography-related article is a stub. You can help Wikipedia by expanding it. |
