Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. L. Massey. Cryptography — a selective survey, in Digital Communications, North-Holland (pub.) (1986), 3–21.
G. J. Simmons. Message authentication: a game on hypergraphs, Congr. Numer. 45 (1984), 161–192.
G. J. Simmons. Authentication theory/coding theory, Lecture Notes in Comput. Sci. 196 (1985), 411–432 (proceedings of CRYPTO 84).
D. R. Stinson. Some constructions and bounds for authentication codes, J. Cryptology 1 (1988), 37–51.
D. R. Stinson. The combinatorics of authentication and secrecy codes, J. Cryptology 2 (1990), 23–49.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stinson, D.R. (1992). Combinatorial characterizations of authentication codes. In: Feigenbaum, J. (eds) Advances in Cryptology — CRYPTO ’91. CRYPTO 1991. Lecture Notes in Computer Science, vol 576. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46766-1_4
Download citation
DOI: https://doi.org/10.1007/3-540-46766-1_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55188-1
Online ISBN: 978-3-540-46766-3
eBook Packages: Springer Book Archive