Expected loss analysis for authentication in constrained channels
Journal article, 2015

We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a number of authentication protocols, 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 and taking into account the cost of incorrect authentication and of communication. This paper describes a framework enabling an expected loss analysis for all the protocols in this family. Computationally simple methods to obtain nearly optimal values for the threshold, as well as for the number of rounds are suggested and upper bounds on the expected loss, holding uniformly, are given. These bounds are tight, as shown by a matching lower bound. Finally, a method to adaptively select both the number of rounds and the threshold is proposed for a certain class of protocols.

expected loss

decision theory



distance bounding


Christos Dimitrakakis

Chalmers, Computer Science and Engineering (Chalmers), Computing Science (Chalmers)

Aikaterini Mitrokotsa

Chalmers, Computer Science and Engineering (Chalmers), Networks and Systems (Chalmers)

Serge Vaudenay

Swiss Federal Institute of Technology in Lausanne (EPFL)

Journal of Computer Security

0926-227X (ISSN)

Vol. 23 2 309-329

Areas of Advance

Information and Communication Technology

Subject Categories

Computer and Information Science

Computer Science



More information

Latest update

5/3/2018 1