Sciweavers

Share
EUROCRYPT
2000
Springer

A Composition Theorem for Universal One-Way Hash Functions

12 years 1 months ago
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.
Victor Shoup
Added 24 Aug 2010
Updated 24 Aug 2010
Type Conference
Year 2000
Where EUROCRYPT
Authors Victor Shoup
Comments (0)
books