Rational distance-bounding protocols over noisy channels

Long H.  Nguyen

Paper 2011/492

Rational distance-bounding protocols over noisy channels

Long H. Nguyen

Abstract

We use ideas from game theory to define a new notion for an optimal threshold for the number of erroneous responses that occur during the rapid-bit exchange over noisy channels in a distance-bounding protocol. The optimal threshold will ensure that even if an intruder attempts to cause incorrect authentication, the expected loss the verifier suffers will still be lower than when the intruder does not attack. Any rational intruder, who always tries to maximise the verifier's loss, will not therefore have any incentive to attack the protocol. We then demonstrate how statistical analysis and binary search can be used to locate such a unique and optimal threshold accurately.

Note: As explained above, this is the extended version of a paper which has been accepted to appear in the 4th International Conference on Security of Information and Networks SIN in November 2011. This version contains a number of formal proofs and some new materials that cannot be put into the published version due to page limit.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. In Proceedings of the 4th International Conference on Security of Information and Networks -- SIN2011
Keywords: distance-bounding protocols RFID protocols game theory
Contact author(s): Long Nguyen @ cs ox ac uk
History: 2011-10-07: last of 2 revisions; 2011-09-13: received; See all versions
Short URL: https://ia.cr/2011/492
License: CC BY

BibTeX

@misc{cryptoeprint:2011/492,
      author = {Long H.  Nguyen},
      title = {Rational distance-bounding protocols over noisy channels},
      howpublished = {Cryptology {ePrint} Archive, Paper 2011/492},
      year = {2011},
      url = {https://eprint.iacr.org/2011/492}
}