Sciweavers

Share
ASIACRYPT
2006
Springer

Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding

9 years 3 months ago
Indifferentiable Security Analysis of Popular Hash Functions with Prefix-Free Padding
Understanding what construction strategy has a chance to be a good hash function is extremely important nowadays. In TCC'04, Maurer et al. [13] introduced the notion of indifferentiability as a generalization of the concept of the indistinguishability of two systems. In Crypto'2005, Coron et al. [5] suggested to employ indifferentiability in generic analysis of hash functions and started by suggesting four constructions which enable eliminating all possible generic attacks against iterative hash functions. In this paper we continue this initial suggestion and we give a formal proof of indifferentiability and indifferentiable attack for prefix-free MD hash functions (for single block length (SBL) hash and also some double block length (DBL) constructions) in the random oracle model and in the ideal cipher model. In particular, we observe that there are sixteen PGV hash functions (with prefix-free padding) which are indifferentiable from random oracle model in the ideal cipher ...
Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yu
Added 20 Aug 2010
Updated 20 Aug 2010
Type Conference
Year 2006
Where ASIACRYPT
Authors Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yung
Comments (0)
books