A composition theorem for universal one-way hash functions

A composition theorem for universal one-way hash functions (2000)

by Victor Shoup

Venue:	In Eurocrypt ’00
Citations:	41 - 5 self

Datum	Value	Source
TITLE	A composition theorem for universal one-way hash functions	INFERENCE
AUTHOR NAME	Victor Shoup	SVM HeaderParse 0.2
AUTHOR AFFIL	IBM Zurich Research Lab, Säumerstr	SVM HeaderParse 0.2
AUTHOR ADDR	4, 8803 Rüschlikon, Switzerland	SVM HeaderParse 0.2
ABSTRACT	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. 1	SVM HeaderParse 0.2
YEAR	2000	INFERENCE
VENUE	In Eurocrypt ’00	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	445--452	INFERENCE
VOLUME	1807	INFERENCE
CITATIONS	9 found	ParsCit 1.0