Bounds on the probability of deception in multiple authentication

The frequently assumed "freshness" constraint on the source states in multiple authentication schemes is not necessary if one allows the encoding rule to change between subsequent transmissions. In the paper it is shown that the main existing lower bounds on the probabilities of successful attack on multiple authentication schemes also hold for this new setup. Furthermore, Stinson's (1988) bound for the substitution attack is strengthened.<
>