TY - GEN
T1 - Indifferentiable security analysis of popular hash functions with prefix-free padding
AU - Chang, Donghoon
AU - Lee, Sangjin
AU - Nandi, Mridul
AU - Yung, Moti
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
PY - 2006
Y1 - 2006
N2 - 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 model.
AB - 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 model.
UR - http://www.scopus.com/inward/record.url?scp=77649256571&partnerID=8YFLogxK
U2 - 10.1007/11935230_19
DO - 10.1007/11935230_19
M3 - Conference contribution
AN - SCOPUS:77649256571
SN - 3540494758
SN - 9783540494751
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 283
EP - 298
BT - Advances in Cryptology - ASIACRYPT 2006 - 12th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
T2 - 12th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2006
Y2 - 3 December 2006 through 7 December 2006
ER -