A Lower Bound On The Probability Of Deception In Multiple Authentication

Abstract

New bounds are derived for the probabilities of successful attack on multiple authentication schemes by re- moving the frequently assumed 'freshness' constraint on the source states. We prove that the overall probability of success- ful deception, PD(L), for a sequences of L uses of the authen- tication channel, is bounded from below by max(k/v, l/d). We also show that if PD(L) = 1/4, then the key entropy is lower bounded by $(L + ))log, b bits and that this bound is tight.