Abstract
Due to their potential use as building blocks for constructing highly efficient message authentication codes (MACs), universal hash-function families have been attracting increasing research attention, both from the design and analysis points of view. In universal hash-function families based MACs, the message to be authenticated is first compressed using a universal hash function and, then, the compressed image is encrypted to produce the authentication tag. Many definitions of universal hash families have appeared in the literature. The main focus of earlier definitions is to classify universal hash functions based on their message collision properties. In this paper, we introduce a different classification of universal hash families. As opposed to classifying universal hash families based on message collision probabilities, our classification aims to give direct relation between universal hash families used as building blocks to design MACs and the encryption algorithm used to process their hashed images. We give two examples of universal hash families with equivalent collision resiliency. We show that, while one constructs secure MACs, the other can lead to insecure MAC construction even when coupled with an encryption algorithm that provides perfect secrecy (in Shannon’s sense). We formally define two classes of universal hash families: independent and dependent universal hash families. We show that, while independent universal hash families provide the desired unforgeability independently of the used encryption algorithm, the security of MACs based on dependent universal hash families is not guaranteed for all choices of encryption algorithms. We conclude by giving a sufficient condition on the encryption algorithm that guarantees the construction of secure MACs, even when combined with a dependent hash family.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alomair, B.: Authenticated Encryption: How Reordering Can Impact Performance. In: Bao, F., Samarati, P., Zhou, J. (eds.) ACNS 2012. LNCS, vol. 7341, pp. 84–99. Springer, Heidelberg (2012)
Alomair, B., Clark, A., Poovendran, R.: The Power of Primes: Security of Authentication Based on a Universal Hash-Function Family. Journal of Mathematical Cryptology 4(2) (2010)
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., Rogaway, P.: UMAC: Fast and Secure Message Authentication. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 216–233. Springer, Heidelberg (1999)
Carter, J., Wegman, M.: Universal classes of hash functions. In: Proceedings of the Ninth Annual ACM Symposium on Theory of Computing-STOC 1977, pp. 106–112. ACM, New York (1977)
Carter, L., Wegman, M.: Universal hash functions. Journal of Computer and System Sciences, JCSS 18(2), 143–154 (1979)
Goldreich, O.: Foundations of Cryptography. Cambridge University Press (2001)
Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270–299 (1984)
Halevi, S., Krawczyk, H.: MMH: Software message authentication in the gbit/Second rates. In: Biham, E. (ed.) FSE 1997. LNCS, vol. 1267, pp. 172–189. Springer, Heidelberg (1997)
Krawczyk, H.: LFSR-based hashing and authentication. In: Desmedt, Y.G. (ed.) Advances in Cryptology - CRYPTO 1994. LNCS, vol. 839, pp. 129–139. Springer, Heidelberg (1994)
Krawczyk, H.: New hash functions for message authentication. In: Guillou, L.C., Quisquater, J.-J. (eds.) Advances in Cryptology - EUROCRYPT 1995. LNCS, vol. 921, pp. 301–310. Springer, Heidelberg (1995)
Rogaway, P.: Bucket hashing and its application to fast message authentication. Journal of Cryptology 12(2), 91–115 (1999)
Shannon, C.: Communication Theory and Secrecy Systems. Bell Telephone Laboratories (1949)
Stinson, D.: Universal hashing and authentication codes. Designs, Codes and Cryptography 4(3), 369–380 (1994)
Tignol, J.: Galois’ Theory of Algebraic Equations. World Scientific (2001)
van Tilborg, H.: Encyclopedia of cryptography and security. Springer (2005)
Wegman, M., Carter, J.: New classes and applications of hash functions. In: 20th Annual Symposium on Foundations of Computer Science-FOCS 1979, pp. 175–182 (1979)
Wegman, M., Carter, L.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences, JCSS 22(3), 265–279 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Alomair, B. (2014). Universal Hash-Function Families: From Hashing to Authentication. In: Pointcheval, D., Vergnaud, D. (eds) Progress in Cryptology – AFRICACRYPT 2014. AFRICACRYPT 2014. Lecture Notes in Computer Science, vol 8469. Springer, Cham. https://doi.org/10.1007/978-3-319-06734-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-06734-6_27
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06733-9
Online ISBN: 978-3-319-06734-6
eBook Packages: Computer ScienceComputer Science (R0)