A Composition Theorem for Universal One-Way Hash Functions

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.

• Type: Conference
• Year: 2000
• Where: EUROCRYPT
• Authors: Victor Shoup
• Keywords: Cryptology, EUROCRYPT 2000, One-way Hash Functions, Universal One-way Hash, Yielding Shorter Keys