Distance bounding in noisy environments

73Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Location information can be used to enhance mutual entity authentication protocols in wireless ad-hoc networks. More specifically, distance bounding protocols have been introduced by Brands and Chaum at Eurocrypt'93 to preclude distance fraud and mafia fraud attacks, in which a local impersonator exploits a remote honest user. Hancke and Kuhn have proposed a solution to cope with noisy channels. This paper presents an improved distance bounding protocol for noisy channels that offers a substantial reduction (about 50%) in the number of communication rounds compared to the Hancke and Kuhn protocol. The main idea is to use binary codes to correct bit errors occurring during the fast bit exchanges. Our protocol is perfectly suitable to be employed in low-cost, noisy wireless environments. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Singelée, D., & Preneel, B. (2007). Distance bounding in noisy environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4572 LNCS, pp. 101–115). Springer Verlag. https://doi.org/10.1007/978-3-540-73275-4_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free