International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: A Synthetic Indifferentiability Analysis of Block Cipher based Hash Functions

Authors:
Zheng Gong
Xuejia Lai
Kefei Chen
Download:
URL: http://eprint.iacr.org/2007/465
Search ePrint
Search Google
Abstract: Nowadays, investigating what construction is better to be a cryptographic hash function is red hot. In TCC'04, Maurer et al. first introduced the notion of indifferentiability as a generalization of the concept of the indistinguishability of two cryptosystems. In AsiaCrypt 06, Chang et al. analyzed the indifferentiability security of some popular block-cipher-based hash functions, such as PGV constructions and MDC-2. In this paper, we investigate Chang et al.'s analysis of PGV constructions and the PBGV double block length constructions. In particular, we point out a more precise adversarial advantage of indifferentiability, by considering the two situations that whether the hash function is either keyed or not. Furthermore, Chang et al. designed attacks on 4 PGV hash functions and PBGV hash function to prove they are differentiable from random oracle with prefix-free padding. We find a limitation in their differentiable attacks and construct our simulations to obtain the controversy results that those schemes are indifferentiable from random oracle with prefix-free padding and some other popular constructions.
BibTeX
@misc{eprint-2007-13745,
  title={A Synthetic Indifferentiability Analysis of Block Cipher based Hash Functions},
  booktitle={IACR Eprint archive},
  keywords={foundations / Hash Function, Block Cipher, Indifferentiability, Random Oracle},
  url={http://eprint.iacr.org/2007/465},
  note={under a journal's review neoyan@sjtu.edu.cn 13859 received 11 Dec 2007},
  author={Zheng Gong and Xuejia Lai and Kefei Chen},
  year=2007
}