The suffix-free-prefix-free hash function construction and its indifferentiability security analysis

Bagheri, Nasour, Gauravaram, Praveen, Knudsen, Lars R., & Zenner, Erik (2012) The suffix-free-prefix-free hash function construction and its indifferentiability security analysis. International Journal of Information Security, 11(6), pp. 419-434.

View at publisher

Abstract

In this paper, we observe that in the seminal work on indifferentiability analysis of iterated hash functions by Coron et al. and in subsequent works, the initial value (IV) of hash functions is fixed. In addition, these indifferentiability results do not depend on the Merkle–Damgård (MD) strengthening in the padding functionality of the hash functions. We propose a generic n -bit-iterated hash function framework based on an n -bit compression function called suffix-free-prefix-free (SFPF) that works for arbitrary IV s and does not possess MD strengthening. We formally prove that SFPF is indifferentiable from a random oracle (RO) when the compression function is viewed as a fixed input-length random oracle (FIL-RO). We show that some hash function constructions proposed in the literature fit in the SFPF framework while others that do not fit in this framework are not indifferentiable from a RO. We also show that the SFPF hash function framework with the provision of MD strengthening generalizes any n -bit-iterated hash function based on an n -bit compression function and with an n -bit chaining value that is proven indifferentiable from a RO.

Impact and interest:

2 citations in Scopus
Search Google Scholar™
2 citations in Web of Science®

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 81620
Item Type: Journal Article
Refereed: Yes
Keywords: Indifferentiability, Merkle–Damgård, MD strengthening, Random oracle, SFPF
DOI: 10.1007/s10207-012-0175-4
ISSN: 1615-5270
Divisions: Current > Schools > School of Electrical Engineering & Computer Science
Current > QUT Faculties and Divisions > Science & Engineering Faculty
Copyright Owner: Copyright 2012 Springer
Deposited On: 05 Feb 2015 01:24
Last Modified: 10 Feb 2015 04:30

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page