Indifferentiable security analysis of popular hash functions with prefix-free padding

Donghoon Chang, Sangjin Lee, Mridul Nandi, Moti Yung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

36 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages283-298
Number of pages16
Volume4284 LNCS
DOIs
Publication statusPublished - 2006 Dec 1
Event12th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2006 - Shanghai, China
Duration: 2006 Dec 32006 Dec 7

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4284 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2006
CountryChina
CityShanghai
Period06/12/306/12/7

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Chang, D., Lee, S., Nandi, M., & Yung, M. (2006). Indifferentiable security analysis of popular hash functions with prefix-free padding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4284 LNCS, pp. 283-298). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4284 LNCS). https://doi.org/10.1007/11935230_19