Abstract
For any authentication code for k source states and v messages having minimum possible deception probabilities (namely, Pd0 = k/v and Pd1 = (k - 1)/(v - 1)), we show that there must be at least v encoding rules. (This can be thought of as an authentication-code analogue of Fisher's Inequality.) We derive several properties that an extremal code must satisfy, and we characterize the extremal codes for equiprobable source states as arising from symmetric balanced incomplete block designs. We also present an infinite class of extremal codes, in which the source states are not equiprobable, derived from affine planes.
Similar content being viewed by others
References
E. F. Brickell, A few results in message authentication, Congressus Numer, Vol. 43(1984), pp. 141–154.
M. De Soete, K. Vedder and M. Walker, Cartesian authentication schemes: Proceedings of EUROCRYPT '89, Lecture Notes in Comput. Sci., 434(1990) pp. 476–490.
M D Soete, New homndl and nnstorntion for authentication / secrecy codes with splitting. Journal of Cryptology Vol. 6(1991) pp. 173–186.
E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, Codes which detect deception, Bell System Tech. Journal, Vol. 53(1974) pp. 405–424.
M. Hall, Jr., Combinatorial Theory, second edition. John Wilcy & Sons (1986).
J. L. Massey, Cryptography-a selective survey, In Digital Communications pp. 3–21. North-Holland (1986).
C. Mitchell, M. Walker and P Wild, The combinatorics of perfect authentication schemes, SIAMJ Discrete Math. Vol. 7(1994) pp. 102 107.
U. Rosenbaum, A lower bound on authentication after having observed a sequence of messages, Journal of Cryptology, Vol. 6(1993) pp. 135 156.
G. J. Simmons, Message authentication: a game on hypergraphs, Congressus Numer, Vol.45(1984) pp. 161–192.
G. J. Simmons, Authentication theory/coding theory: Proceedings of CRYPTO '84, Lecture Notes in Comput. Sci., 196(1985) pp. 411–432.
G. J. Simmons, Anaturaltaxonomy fordigial information lthntication schemes: Poceedings of CRYPTO '87, Lecture Notes in Comput. Sci., 293(1988) pp. 269–288.
G. J. Simmons, A survey of information authentication, In Contemporary Cryptology The Science of Information Integrity, pp. 379–419. IEEE Press (1992).
D. R. Stinson, Some constructions and bounds forauthentication codes, Journalof Cryptology Vol. 1 (1988) pp. 37–51.
D. R Stinson, The combinatorics of authentication and secrecy codes, Journal of Cryptology Vol. 2(1990) pp. 23–49.
D. R. Stinson, Combinatorial characterizations of authentication codes, Designs, Codes, and Cryptography Vol. 2(1992) pp175–187.
D. R. Stinson, Combinatorial designs and cryptography, In Surveys in Combinatorics, 1993, pp. 257–287. Cambridge University Press (1993).
M. Walker, Information-theoretic bounds for authentication schemes, Journal of Cryptology, Vol. 2(1990) pp. 131–144.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rees, R.S., Stinson, D.R. Combinatorial Characterizations of Authentication Codes II. Designs, Codes and Cryptography 7, 239–259 (1996). https://doi.org/10.1023/A:1018094824862
Issue Date:
DOI: https://doi.org/10.1023/A:1018094824862