Expected loss analysis of thresholded authentication protocols in noisy conditions

A number of authentication protocols have been proposed recently, where at least some part of the authentication is performed during a phase, lasting $n$ rounds, with no error correction. This requires assigning an acceptable threshold for the number of detected errors. This paper describes a framework enabling an expected loss analysis for all the protocols in this family. Furthermore, computationally simple methods to obtain nearly optimal value of the threshold, as well as for the number of rounds is suggested. Finally, a method to adaptively select both the number of rounds and the threshold is proposed.

[1]  Laurent Bussard,et al.  Distance-Bounding Proof of Knowledge to Avoid Real-Time Attacks , 2005, SEC.

[2]  J. Andel.  Sequential Analysis , 2022, The SAGE Encyclopedia of Research Design.

[3]  H. Chernoff.  A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations , 1952 .

[4]  Bart Preneel,et al.  Distance Bounding in Noisy Environments , 2007, ESAS.

[5]  Julio C. Hernandez-Castro,et al.  Shedding Light on RFID Distance Bounding Protocols and Terrorist Fraud Attacks , 2009 .

[6]  Srdjan Capkun,et al.  Secure positioning in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[7]  Juan Manuel González Nieto,et al.  Detecting relay attacks with timing-based protocols , 2007, ASIACCS '07.

[8]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[9]  Gildas Avoine,et al.  RFID Distance Bounding Protocol with Mixed Challenges to Prevent Relay Attacks , 2009, CANS.

[10]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[11]  M. Degroot.  Optimal Statistical Decisions , 1970 .

[12]  Cédric Lauradoux,et al.  Distance Bounding Protocols on TH-UWB Radios , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[13]  Serge Vaudenay,et al.  Distinguishing Distributions Using Chernoff Information , 2010, ProvSec.

[14]  Gildas Avoine,et al.  The Swiss-Knife RFID Distance Bounding Protocol , 2008, ICISC.

[15]  H. Vincent Poor,et al.  Authentication Over Noisy Channels , 2008, IEEE Transactions on Information Theory.

[16]  Faculteit Ingenieurswetenschappen.  Study and Design of a Security Architecture for Wireless Personal Area Networks , 2008 .

[17]  William Stallings,et al.  Cryptography and network security , 1998 .

[18]  H. Chernoff.  Sequential Design of Experiments , 1959 .

[19]  Markus G. Kuhn,et al.  An RFID Distance Bounding Protocol , 2005, First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05).

[20]  Srdjan Capkun,et al.  SECTOR: secure tracking of node encounters in multi-hop wireless networks , 2003, SASN '03.

[21]  Srdjan Capkun,et al.  ID-Based Secure Distance Bounding and Localization , 2009, ESORICS.