Abstract
In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash fixed-length messages. The new construction is extremely simple and is also very efficient, yielding shorter keys than previously proposed composition constructions.
Chapter PDF
Similar content being viewed by others
References
M. Bellare and P. Rogaway. Collision-resistant hashing: towards making UOWHFs practical. In Advances in Cryptology-Crypto’ 97, 1997.
I. Damgard. Collision free hash functions and public key signature schemes. In Advances in Cryptology-Eurocrypt’ 87, 1987.
I. Damgard. A design principle for hash functions. In Advances in Cryptology-Crypto’ 89, 1989.
D. den Boer and A. Bosselaers. Collisions for the compression function of MD5. In Advances in Cryptology-Eurocrypt’ 93, pages 293–304, 1993.
H. Dobbertin. The status of MD5 after a recent attack. RSA Laboratories’ CryptoBytes, 2(2), 1996. The main result of this paper was announced at the Eurocrypt’ 96 rump session.
R. Merkle. One way hash functions and DES. In Advances in Cryptology-Crypto’ 89, 1989.
M. Naor and M. Yung. Universal one-way hash functions and their cryptographic applications. In 21st Annual ACM Symposium on Theory of Computing, 1989.
D. Simon. Finding collisions on a one-way street: can secure hash functions be based on general assumptions? In Advances in Cryptology-Eurocrypt’ 98, pages 334–345, 1998.
M. Wegman and L. Carter. New hash functions and their use in authentication and set equality. J. of Computer and System Sciences, 22:265–279, 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shoup, V. (2000). A Composition Theorem for Universal One-Way Hash Functions. In: Preneel, B. (eds) Advances in Cryptology — EUROCRYPT 2000. EUROCRYPT 2000. Lecture Notes in Computer Science, vol 1807. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45539-6_32
Download citation
DOI: https://doi.org/10.1007/3-540-45539-6_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67517-4
Online ISBN: 978-3-540-45539-4
eBook Packages: Springer Book Archive