Paper 2008/319

Yet Another Secure Distance-Bounding Protocol

Ventzislav Nikov and Marc Vauclair

Abstract

Distance-bounding protocols have been proposed by Brands and Chaum in 1993 in order to detect \emph{relay attacks}, also known as \emph{mafia fraud}. Although the idea has been introduced fifteen years ago, only recently distance-bounding protocols attracted the attention of the researchers. Several new protocols have been proposed the last five years. In this paper, a new secure distance-bounding protocol is presented. It is self-contained and composable with other protocols for example for authentication or key-negotiation. It allows periodically execution and achieves better use of the communication channels by exchanging authenticated nonces. The proposed protocol becomes suitable for wider class of devices, since the resource requirements to the prover are relaxed.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Published elsewhere. This is the full version of the paper with the same title in SECRYPT 2008.
Keywords
Distance-Bounding protocolsRelay AttacksMafia-Fraud
Contact author(s)
venci nikov @ gmail com
History
2008-08-02: received
Short URL
https://ia.cr/2008/319
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/319,
      author = {Ventzislav Nikov and Marc Vauclair},
      title = {Yet Another Secure Distance-Bounding Protocol},
      howpublished = {Cryptology ePrint Archive, Paper 2008/319},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/319}},
      url = {https://eprint.iacr.org/2008/319}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.