Title :
Bounds on the probability of deception in multiple authentication
Author_Institution :
Dept. of Inf. Theory, Lund Univ.
fDate :
9/1/1994 12:00:00 AM
Abstract :
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
Keywords :
encoding; message authentication; probability; Stinson´s bound; encoding rule; freshness constraint; lower bounds; multiple authentication; probability of deception; source states; subsequent transmissions; substitution attack; successful attack; Authentication; Councils; Cryptography; Encoding; Information theory; Protection; Transmitters;
Journal_Title :
Information Theory, IEEE Transactions on