Open Access
Limitations on the Usage of Noise Resilient Distance Bounding Protocols
Dave Singelée,Bart Preneel +1 more
Reads0
Chats0
TLDR
This paper investigates the robustness to high bit error rates of two important secure noise resilient distance bounding protocols: the RFID protocol of Hancke and Kuhn (SECURECOMM ’05) and the noise resilient MAD protocol of Singelee and Preneel (ESAS ’07).Abstract:
Distance bounding protocols can be employed in mutual entity authentication schemes to determine an upper bound on the distance to another entity. As these protocols are conducted over noisy wireless adhoc channels, they should be designed to cope well with substantial bit error rates during the rapid single bit exchanges. This paper investigates the robustness to high bit error rates of two important secure noise resilient distance bounding protocols: the RFID protocol of Hancke and Kuhn (SECURECOMM ’05), and the noise resilient MAD protocol of Singelee and Preneel (ESAS ’07). In order to satisfy the specified design criteria, the bit error rate should not exceed a particular threshold value. The results of our paper help to compare both noise resilient distance bounding protocols in the scenario where they are employed in extremely noisy environments, and assist to choose the appropriate design parameters, such as the minimal required number of fast bit exchanges.read more
Citations
More filters
Study and Design of a Security Architecture for Wireless Personal Area Networks
TL;DR: This doctoral thesis presents a formal model of location privacy for WPAN, and discusses the cryptographic and physical design principles that have to be taken into account to design a secure distance bounding protocol, and presents some interesting applications ofdistance bounding protocols.
Secure Neighbor Discovery and Ranging in Wireless Networks
TL;DR: This thesis builds a formal model that captures salient characteristics of wireless systems such as node location, message propagation time and link variability, and provides a specification of secure communication neighbor discovery, and proves that specific protocols in the time-based class (under additional conditions) andSpecific protocols in a class the authors term "time- and location-based protocols," satisfy the neighbor discovery specification.
Proceedings ArticleDOI
Security Implications of Implementing Multistate Distance-Bounding Protocols
TL;DR: It is shown that implementing multistate responses using simple m- ary modulation methods found in contactless devices, does not necessarily provide the expected security improvement when devices have finite transmission energy to spend on challenge-response exchanges.
References
More filters
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Book ChapterDOI
Distance-bounding protocols
Stefan A. Brands,David Chaum +1 more
TL;DR: 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.
Proceedings ArticleDOI
An RFID Distance Bounding Protocol
Gerhard P. Hancke,Markus G. Kuhn +1 more
TL;DR: A new distance-bounding protocol based on ultra-wideband pulse communication is proposed, aimed at being implementable using only simple, asynchronous, low-power hardware in the token, particularly well suited for use in passive low-cost tokens, noisy environments and high-speed applications.
Proceedings ArticleDOI
SECTOR: secure tracking of node encounters in multi-hop wireless networks
TL;DR: 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.
Journal ArticleDOI
Binary codes with specified minimum distance
TL;DR: New results are given in the field in the form of theorems which permit systematic construction of codes for given n, d ; for some n,d , the codes contain the greatest possible numbers of points.
Related Papers (5)
A Computationally Efficient and Secure Time Synchronization Scheme for Wireless Applications
Carol A. Barnett,K. J. Ray Liu +1 more