Generic Indifferentiability Proofs of Hash Designs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Generic Indifferentiability Proofs of Hash Designs

Marion Daubignard
  • Function : Author
  • PersonId : 962336
Yassine Lakhnech
  • Function : Author
  • PersonId : 837979


—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.
Fichier principal
Vignette du fichier
csf12.pdf (374.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01094323 , version 1 (12-12-2014)



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



Gmail Facebook Twitter LinkedIn More