Hash Functions: From Merkle-Damgård to Shoup

Hash Functions: From Merkle-Damgård to Shoup (2001)

by Ilya Mironov

Venue:	EUROCRYPT
Citations:	15 - 0 self

User correction supplied by mph

Datum	Value	Source
TITLE	Hash Functions: From Merkle-Damgård to Shoup	user correction
AUTHOR NAME	Ilya Mironov	user correction
AUTHOR AFFIL	Computer Science Department, Stanford University	user correction
AUTHOR ADDR	Stanford CA 94305	user correction
ABSTRACT	In this paper we study two possible approaches to improving existing schemes for constructing hash functions that hash arbitrary long messages. First, we introduce a continuum of function classes that lie between universal one-way hash functions and collision-resistant functions. For some of these classes efficient (yielding short keys) composite schemes exist. Second, we prove that the schedule of the Shoup construction, which is the most efficient composition scheme for universal one-way hash functions known so far, is optimal.	user correction
YEAR	2001	user correction
VENUE	EUROCRYPT	user correction
VENUE TYPE	JOURNAL	INFERENCE
PAGES	166181	INFERENCE
CITATIONS	16 found	ParsCit 1.0