Reid et al.'s distance bounding protocol and mafia fraud attacks over noisy channels

Open Access
Authors
  • A. Mitrokotsa
  • C. Dimitrakakis
  • P. Peris-Lopez
  • J.C. Hernandez-Castro
Publication date 2010
Journal IEEE Communications Letters
Volume | Issue number 14 | 2
Pages (from-to) 121-123
Organisations
  • Faculty of Science (FNWI) - Informatics Institute (IVI)
Abstract
Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, mafia fraud and terrorist fraud attacks. Reid et al. proposed the first symmetric key distance bounding protocol against mafia and terrorist fraud attacks [1]. However, [2] claims that this is only achieved with a (7/8)(n) probability of success for mafia fraud, rather than the theoretical value of (3/4)(n) (for n rounds) achieved by distance bounding protocols without a final signature. We prove that the mafia fraud attack success using the Reid et al. protocol is bounded by (3/4)(n) and reduces as noise increases. The proof can be of further interest as it is the first - to the best of our knowledge - detailed analysis of the effects of communication errors on the security of a distance bounding protocol.
Document type Article
Published at
Downloads
311941.pdf (Final published version)
Permalink to this page
Back