Secure and lightweight distance-bounding
Paper i proceeding, 2013

Distance-bounding is a practical solution aiming to prevent relay attacks. The main challenge when designing such protocols is maintaining their inexpensive cryptographic nature, whilst being able to protect against as many, if not all, of the classical threats posed in their context. Moreover, in distance-bounding, some subtle security shortcomings related to the PRF (pseudorandom function) assumption and ingenious attack techniques based on observing verifiers' outputs have recently been put forward. Also, the recent terrorist-fraud by Hancke somehow recalls once more the need to account for noisy communications in the security analysis of distance-bounding. In this paper, we attempt to incorporate the lessons taught by these new developments in our distance-bounding protocol design. The result is a new class of protocols, with increasing levels of security, accommodating the latest advances; at the same time, we preserve the lightweight nature of the design throughout the whole class. © 2013 Springer-Verlag.

Författare

I. Boureanu

Aikaterini Mitrokotsa

Chalmers, Data- och informationsteknik, Nätverk och system

S. Vaudenay

Lecture Notes in Computer Science

0302-9743 (ISSN)

Vol. 8162

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Datavetenskap (datalogi)

DOI

10.1007/978-3-642-40392-7_8

ISBN

9783642403910