How secret-sharing can defeat terrorist fraud
(2011) Fourth ACM Conference on Wireless Network Security — Location: Hamburg, Germany (14.June.2011)
Files
p145-avoine.pdf
Restricted Access - Adobe PDF
- 464.56 KB
Details
- Authors
- Abstract
- Terrorist fraud is a relay attack against distance bounding protocols where the prover conspires with an adversary to misrepresent the distance between himself and the verifier. In ideal situations, the adversary does not gain any knowledge about the prover’s long-term secret. This makes designing a distance bounding protocol resistant to a such fraud tricky: the secrets of an honest prover must be protected, while those of a dishonest one should be disclosed as an incentive not to cheat. In this paper, we demonstrate that using a secret-sharing scheme, possibly based on threshold cryptography, is well suited for thwarting terrorist fraud. Although such an idea has been around since the work of Bussard and Bagga, this is the first time that secret-sharing and terrorist fraud have been systematically studied altogether. We prove that secret sharing can counter terrorist fraud, and we detail a method that can be applied directly to most existing distance bounding protocols. We illustrate our method on the protocol of Hancke and Kuhn, yielding two variants: the threshold distance bounding (tdb) protocol and the thrifty threshold distance bounding (ttdb) protocol. We define the adversarial strategies that attempt to gain some knowledge on the prover’s long-term secret, evaluate the amount of information disclosed, and determine the adversary’s success probability.
- Affiliations
Université de Lyon INSA-Lyon, CITI
Citations
Avoine, G., Lauradoux, C., & Martin, B. (2011). How secret-sharing can defeat terrorist fraud. Proceedings of the fourth ACM conference on Wireless network security, p. 145-156. https://doi.org/10.1145/1998412.1998437