A Composition Theorem for Universal One-Way Hash Functions

Victor Shoup

Paper 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.

Metadata

Available format(s): PS
Publication info: Published elsewhere. Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
Keywords: collision free hashing target collision resistance composition
Contact author(s): sho @ zurich ibm com
History: 1999-07-22: received
Short URL: https://ia.cr/1999/017
License: CC BY

BibTeX

@misc{cryptoeprint:1999/017,
      author = {Victor Shoup},
      title = {A Composition Theorem for Universal One-Way Hash Functions},
      howpublished = {Cryptology {ePrint} Archive, Paper 1999/017},
      year = {1999},
      url = {https://eprint.iacr.org/1999/017}
}