Sound Hashing Modes of Arbitrary Functions, Permutations, and Block Ciphers
Keywords:Hash functions, tree hashing, generalization, sufficient conditions, indifferentiability, tight
Cryptographic hashing modes come in many flavors, including Merkle-Damgård with various types of strengthening, Merkle trees, and sponge functions. As underlying primitives, these functions use arbitrary functions, permutations, or block ciphers. In this work we provide three simple proofs, one per primitive type, that cover all modes where the input to the primitive consists of message bits, chaining value bits, and bits that only depend on the mode and message length. Our approach generalizes and simplifies over earlier attempts of Dodis et al. (FSE 2009) and Bertoni et al. (Int. J. Inf. Sec. 2014). We prove tight indifferentiability bounds for modes using each of these three primitive types provided that the mode satisfies some easy to verify conditions.
How to Cite
Copyright (c) 2018 Joan Daemen, Bart Mennink, Gilles Van Assche
This work is licensed under a Creative Commons Attribution 4.0 International License.