By Topic

Distance Bounding with Delayed Responses

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sangho Lee ; Dept. of Comput. Sci. & Eng., Pohang Univ. of Sci. & Technol. (POSTECH), Pohang, South Korea ; Jin Seok Kim ; Sung Je Hong ; Jong Kim

Distance-bounding protocols enable the establishment of an upper bound on the distance between two communicating parties in such a way that their degree of proximity can be verified. Most of these protocols rely on multi-rounds of single-bit challenge and response. Therefore, in each round, the probability that an adversary will guess the correct response is 1/2. This letter proposes a new method to increase the number of response states of distance-bounding protocols by injecting intentional delays to each round. Our method can reduce the probability of a correct guess from 1/2 to 1/(2k) for each round, where k is the number of different delays, without significant modifications of underlying protocols. Moreover, it can be applied to passive RFID tags, because it requires no special hardware equipment.

Published in:

Communications Letters, IEEE  (Volume:16 ,  Issue: 9 )