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

  • 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 hashIn 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 IVs 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.show moreshow less

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Nasour Bagheri, Praveen Gauravaram, Lars R. Knudsen, Erik ZennerGND
Publisher:Springer
Date of Publication (online):2012/09/12
Language:English
GND Keyword:Präfix; Sicherheitstechnik; Suffix
Parent Title (English):International Journal of Information Security
Volume:11
Issue:6
ISSN:1615-5262
First Page:419
Last Page:434
Document Type:Article (reviewed)
Institutes:Hochschule Offenburg / Bibliografie
Acces Right:Frei zugänglich
Release Date:2019/10/24
Licence (German):License LogoEs gilt das UrhG
URL:https://orbit.dtu.dk/files/23334661/http_dtu_ftc.cvt.dk_cgi_bin_fulltext_springer_pi_10207_2012_175.pdf_key_372462967_rfr_id_info_sid_dlib.dtu.pdf
DOI:https://doi.org/10.1007/s10207-012-0175-4