is the full version. How to Build a Hash Function from any Collision-Resistant Function

is the full version. How to Build a Hash Function from any Collision-Resistant Function (2008)

Cached

Download Links

[eprint.iacr.org]

by Thomas Ristenpart , Thomas Shrimpton

Versions

Version 0

Version History

Metadata Version 0

Datum	Value	Source
TITLE	is the full version. How to Build a Hash Function from any Collision-Resistant Function	SVM HeaderParse 0.2
AUTHOR NAME	Thomas Ristenpart	SVM HeaderParse 0.2
AUTHOR AFFIL	Dept. of Computer Science & Engineering 0404, University of California San Diego	SVM HeaderParse 0.2
AUTHOR ADDR	9500 Gilman Drive, La; Jolla, CA 92093-0404, USA.	SVM HeaderParse 0.2
AUTHOR NAME	Thomas Shrimpton	SVM HeaderParse 0.2
AUTHOR AFFIL	CNS 0627752.; Faculty of Informatics	SVM HeaderParse 0.2
AUTHOR ADDR	University of Lugano Via Buffi 13, CH-6900 Lugano, Switzerland. Email:	SVM HeaderParse 0.2
ABSTRACT	Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision in a provably CR function implies the ability to solve some hard problem (e.g., factoring). Unfortunately, existing provably CR functions make poor replacements for hash functions as they fail to deliver behaviors demanded by practical use. In particular, they are easily distinguished from a random oracle. We initiate an investigation into building hash functions from provably CR functions. As a method for achieving this, we present the Mix-Compress-Mix (MCM) construction; it envelopes any provably CR function H (with suitable regularity properties) between two injective “mixing ” stages. The MCM construction simultaneously enjoys (1) provable collision-resistance in the standard model, and (2) indifferentiability from a monolithic random oracle when the mixing stages themselves are indifferentiable from a random oracle that observes injectivity. We instantiate our new design approach by specifying a blockcipher-based construction that	SVM HeaderParse 0.2
YEAR	2008	SVM HeaderParse 0.2
CITATIONS	38 found	ParsCit 1.0