Title: An efficient mutual distance bounding protocol over a binary symmetric noisy communication channel

Authors: Hoda Jannati; Abolfazl Falahati

Addresses: Department of Electrical Engineering (DCCS Lab), Iran University of Science and Technology, Tehran 1684613114, Iran ' Department of Electrical Engineering (DCCS Lab), Iran University of Science and Technology, Tehran 1684613114, Iran

Abstract: Distance bounding protocols have been suggested to protect an RFID communication system against relay attack. In such protocols, a verifier establishes an upper bound for the physical distance between a user and itself as well as authenticating the user. Recently, mutual distance bounding protocols in which both communication parties play not only as a user but also as a verifier have been proposed to be deployed for secure positioning protocols. In this paper, the performance of the existing mutual distance bounding protocols is analysed over a noisy communication channel. The analytic results show that these protocols provide a much higher rejection probability of a valid user due to channel errors than distance bounding protocols. Furthermore, a novel method is proposed to convert every distance bounding protocol into a mutual distance bounding protocol. Within this method, for each one of the two communication parties, the produced mutual distance bounding protocol provides the performance and security level exactly equal to those of its own associated distance bounding protocol at the same noisy environment, without transmitting any extra messages at the end of the protocol.

Keywords: mutual distance bounding protocol; distance fraud attacks; mafia fraud attacks; relay attacks; false-accept probability; false-reject probability; rapid bit exchange; noisy communication channels; RFID communication; radio frequency identification.

DOI: 10.1504/IJAHUC.2015.071658

International Journal of Ad Hoc and Ubiquitous Computing, 2015 Vol.20 No.1, pp.1 - 16

Received: 22 Aug 2013
Accepted: 26 Oct 2013
Published online: 14 Sep 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article