Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, EpiSciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Conference papers

Generic Indifferentiability Proofs of Hash Designs

Abstract : —In this paper, we propose a formal analysis of domain extenders for hash functions in the indiffer-entiability framework. We define a general model for domain extenders and provide a unified proof of their security in the form of a generic reduction theorem. Our general model for domain exenders captures many iterated constructions such as domain extenders, modes of operation of symmetric cryptography such as CBC-MAC or blockciphers based on Feistel networks. Its proof has been carried out using the Computational Indistin-guishability Logic of Barthe et al.. The theorem can help designers of hash functions justifying the security of their constructions: they only need to bound the probability of well-defined events. Our model allows to consider many SHA-3 finalists and is instantiated on two well-known constructions, namely Chop-MD and Sponge. Finally, the indifferentiability bounds which we prove are convincing since they match previous proofs.
Document type :
Conference papers
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Pierre-Alain Fouque Connect in order to contact the contributor
Submitted on : Friday, December 12, 2014 - 10:10:43 AM
Last modification on : Thursday, March 17, 2022 - 10:08:27 AM
Long-term archiving on: : Friday, March 13, 2015 - 10:30:58 AM


Files produced by the author(s)




Marion Daubignard, Pierre-Alain Fouque, yassine Lakhnech. Generic Indifferentiability Proofs of Hash Designs. 25th Computer Security Foundations Symposium, 2012, Jun 2012, Cambridge, United States. pp.14, ⟨10.1109/CSF.2012.13⟩. ⟨hal-01094323⟩



Record views


Files downloads