Rational distance−bounding protocols over noisy channels
Long Hoang 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.
Details
| Journal |
The 4th International Conference on Security of Information and Networks SIN 2011 |
| Series |
The International Conference Proceedings Series by the ACM |
| Year |
2011 |
Links
Related pages
|
People |