Rational distance−bounding protocols over noisy channels
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 aut...
| Main Author: | |
|---|---|
| Format: | Journal article |
| Published: |
2011
|
| _version_ | 1797070853360320512 |
|---|---|
| author | Nguyen, L |
| author_facet | Nguyen, L |
| author_sort | Nguyen, L |
| collection | OXFORD |
| description | 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. |
| first_indexed | 2024-03-06T22:44:57Z |
| format | Journal article |
| id | oxford-uuid:5cda9ed6-97e7-4c3e-8b8e-3b3228ad3d01 |
| institution | University of Oxford |
| last_indexed | 2024-03-06T22:44:57Z |
| publishDate | 2011 |
| record_format | dspace |
| spelling | oxford-uuid:5cda9ed6-97e7-4c3e-8b8e-3b3228ad3d012022-03-26T17:30:45ZRational distance−bounding protocols over noisy channelsJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:5cda9ed6-97e7-4c3e-8b8e-3b3228ad3d01Department of Computer Science2011Nguyen, LWe 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. |
| spellingShingle | Nguyen, L Rational distance−bounding protocols over noisy channels |
| title | Rational distance−bounding protocols over noisy channels |
| title_full | Rational distance−bounding protocols over noisy channels |
| title_fullStr | Rational distance−bounding protocols over noisy channels |
| title_full_unstemmed | Rational distance−bounding protocols over noisy channels |
| title_short | Rational distance−bounding protocols over noisy channels |
| title_sort | rational distance bounding protocols over noisy channels |
| work_keys_str_mv | AT nguyenl rationaldistanceboundingprotocolsovernoisychannels |