Abstract
In this paper, we study the application of universal hashing to the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the number of authenticators is exponentially small compared to the number of possible source states (plaintext messages). We formally define some new classes of hash functions and then prove some new bounds and give some general constructions for these classes of hash functions. Then we discuss the implications to authentication codes.
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. Carter and M. N. Wegman. Universal classes of hash functions, J. Comput. System Sci. 18 (1979), 143–154.
R. L. Plackett and J. P. Burman. The design of optimum multi-factorial experiments, Biometrika 33 (1945), 305–325.
D. V. Sarwate. A note on universal classes of hash functions, Inform. Proc. Letters 10 (1980), 41–45.
G. J. Simmons. Message authentication: a game on hypergraphs, Congr. Numer. 45 (1984), 161–192.
G. J. Simmons. A survey of information authentication, Proc. of the IEEE 76 (1988), 603–620.
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.
D. R. Stinson. Combinatorial techniques for universal hashing, submitted to J. Comput. System Sci.
D. R. Stinson. Combinatorial characterizations of authentication codes, submitted to Designs, Codes and Cryptography (a preliminary version appears elsewhere in these proceedings).
M. N. Wegman and J. L. Carter. New hash functions and their use in authentication and set equality, J. Comput. System Sci. 22 (1981), 265–279.
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). Universal hashing and 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_5
Download citation
DOI: https://doi.org/10.1007/3-540-46766-1_5
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