Cryptology ePrint Archive: Report 2011/028

The Parazoa Family: Generalizing the Sponge Hash Functions

Elena Andreeva and Bart Mennink and Bart Preneel

Abstract: Sponge functions were introduced by Bertoni et al. as an alternative to the classical Merkle-Damgaard design. Many hash function submissions to the SHA-3 competition launched by NIST in 2007, such as CubeHash, Fugue, Hamsi, JH, Keccak and Luffa, derive from the original sponge design, and security guarantees from some of these constructions are typically based on indifferentiability results. Although indifferentiability proofs for these designs often bear significant similarities, these have so far been obtained independently for each construction. In this work, we introduce the parazoa family of hash functions as a generalization of ``sponge-like'' functions. Similarly to the sponge design, the parazoa family consists of compression and extraction phases. The parazoa hash functions, however, extend the sponge construction by enabling the use of a wider class of compression and extraction functions that need to satisfy certain properties. More importantly, we prove that the parazoa functions satisfy the indifferentiability notion of Maurer et al. under the assumption that the underlying permutation is ideal. Not surprisingly, our indifferentiability result confirms the bound on the original sponge function, but it also carries over to a wider spectrum of hash functions and eliminates the need for a separate indifferentiability analysis.

Category / Keywords: secret-key cryptography / Parazoa functions, sponge functions, hash function design, indifferentiability

Publication Info: appears in the International Journal of Information Security

Date: received 14 Jan 2011, last revised 10 Feb 2012

Contact author: bart mennink at esat kuleuven be

Available format(s): PDF | BibTeX Citation

Version: 20120210:075233 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]