Abstract
In this paper, we study unconditionally secure codes that provide authentication without secrecy. Our point of view is the universal hashing approach pioneered by Wegman and Carter in 1981. We first compare several recent universal-hashing based constructions for authentication codes. Then we generalize the theory of universal hashing in order to accommodate the situation where we would like to authenticate a sequence of messages with the same key. Unlike previous methods for doing this, we do not require that each message in the sequence have a “counter” attached to it.
Chapter PDF
Similar content being viewed by others
References
J. Bierbrauer, Universal hashing and geometric codes, to appear in Designs, Codes and Cryptography.
J. Bierbrauer, Construction of orthogonal arrays, to appear in Journal of Statistical Planning and Inference.
J. Bierbrauer, T. Johansson, G. Kabatianskii and B. Smeets, On families of hash functions via geometric codes and concatenation, in “Advances in Cryptology — CRYPTO’ 93”, D. R. Stinson, ed., Lecture Notes in Computer Science 773 (1994), 331–342.
B. den Boer, A simple and key-economical unconditional authentication scheme, Journal of Computer Security 2 (1993), 65–71.
E. N. Gilbert, F. J. MacWilliams and N. J. A. Sloane, Codes which detect deception, Bell System Technical Journal 53 (1974), 405–424.
T. Helleseth and T. Johansson, Universal hash functions from exponential sums over finite fields and Galois rings, in “Advances in Cryptology — CRYPTO’ 96”, N. Koblitz, ed, Lecture Notes in Computer Science (1996).
H. Krawczyk, LFSR-based hashing and authentication, in “Advances in Cryptology — CRYPTO’ 94”, Y. G. Desmedt, ed., Lecture Notes in Computer Science 839 (1994), 129–139.
H. Krawczyk, New hash functions for message authentication, in “Advances in Cryptology — EUROCRYPT’ 95”, L. C. Guillou and J.-J. Quisquater, eds., Lecture Notes in Computer Science 921 (1995), 301–310.
J. L. Massey, Cryptography — a selective survey, in “Digital Communications”, E. Biglieri and G. Prati, eds., North-Holland, 1986, 3–21. [Also published in Alta Frequenza 55 (1986), 4–11.]
P. Rogaway, Bucket hashing and its application to fast message authentication, in “Advances in Cryptology CRYPTO’ 95”, D. Coppersmith, ed., Lecture Notes in Computer Science 963 (1995), 29–42.
G. J. Simmons, A survey of information authentication, in “Contemporary Cryptology, The Science of Information Integrity”, G. J. Simmons, ed., IEEE Press, 1992, 379–419. [Preliminary version appeared in Proceedings of the IEEE 76 (1988), 603–620.]
D. R. Stinson, Universal hashing and authentication codes, in “Advances in Cryptology CRYPTO’ 91”, J. Feigenbaum, ed., Lecture Notes in Computer Science 576 (1992), 74–85.
D. R. Stinson, Universal hashing and authentication codes, Designs, Codes and Cryptography 4 (1994), 369–380.
D. R. Stinson, On the connections between universal hashing, combinatorial designs and error-correcting codes, to appear in Congressus Numerantium 115 (1996). [Also appears in Electronic Colloquium on Computational Complexity, Report TR95-052.]
R. Taylor, Nearly optimal unconditionally secure authentication, in “Advances in Cryptology — EUROCRYPT’ 94”, A. De Santis, ed., Lecture Notes in Computer Science 950 (1995), 244–253.
M. N. Wegman and J. L. Carter, New hash functions and their use in authentication and set equality, Journal of Computer and System Sciences 22 (1981), 265–279.
Y. Zheng, T. Hardjono and J. Pieprzyk, Sibling intractable function families and their applications, in “Advances in Cryptology — ASIACRYPT’ 91”, H. Imai, R. L. Rivest and T. Matsumoto, eds., Lecture Notes in Computer Science 739 (1993), 124–138.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atici, M., Stinson, D.R. (1996). Universal Hashing and Multiple Authentication. In: Koblitz, N. (eds) Advances in Cryptology — CRYPTO ’96. CRYPTO 1996. Lecture Notes in Computer Science, vol 1109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68697-5_2
Download citation
DOI: https://doi.org/10.1007/3-540-68697-5_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61512-5
Online ISBN: 978-3-540-68697-2
eBook Packages: Springer Book Archive