Paper 2011/459
Sufficient conditions for sound hashing using a truncated permutation
Joan Daemen, Tony Dusenge, and Gilles Van Assche
Abstract
In this paper we give a generic security proof for hashing modes that make use of an underlying fixed-length permutation. We formulate a set of five simple conditions, which are easy to implement and to verify, for such a hashing mode to be sound. These hashing modes include tree hashing modes and sequential hashing modes. We provide a proof that for any hashing mode satisfying the five conditions, the advantage in differentiating it from an ideal monolithic hash function is upper bounded by q^2/2^{n+1} with q the number of queries to the underlying permutation and n the length of the chaining values.
Metadata
- Available format(s)
-
PDF
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- permutation-based hashingindifferentiabilitytree hashing
- Contact author(s)
- gilles vanassche @ st com
- History
- 2011-08-24: received
- Short URL
- https://ia.cr/2011/459
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2011/459,
author = {Joan Daemen and Tony Dusenge and Gilles Van Assche},
title = {Sufficient conditions for sound hashing using a truncated permutation},
howpublished = {Cryptology ePrint Archive, Paper 2011/459},
year = {2011},
note = {\url{https://eprint.iacr.org/2011/459}},
url = {https://eprint.iacr.org/2011/459}
}
