Combinatorial characterizations of authe
โ
D. R. Stinson
๐
Article
๐
1992
๐
Springer
๐
English
โ 536 KB
In this paper, we prove two new combinatorial characterizations of authentication codes. Authentication codes without secrecy are characterized in terms of orthogonal arrays; and general authentication codes are characterized in terms of balanced incomplete block designs. In both of these characteri