Cryptology ePrint Archive: Report 1999/017

A Composition Theorem for Universal One-Way Hash Functions

Victor Shoup

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.

Category / Keywords: collision free hashing, target collision resistance, composition

Publication Info: Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.

Date: received July 22, 1999. Also available as IBM Research Report 3147.

Contact author: sho at zurich ibm com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Short URL: ia.cr/1999/017

Discussion forum: Show discussion | Start new discussion