CryptoDB
A Composition Theorem for Universal One-Way Hash Functions
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-1999-11338, title={A Composition Theorem for Universal One-Way Hash Functions}, booktitle={IACR Eprint archive}, keywords={collision free hashing, target collision resistance, composition}, url={http://eprint.iacr.org/1999/017}, note={Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive. sho@zurich.ibm.com 10500 received July 22, 1999. Also available as IBM Research Report 3147.}, author={Victor Shoup}, year=1999 }