eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20110824:041041 of this paper.
See the latest version.
Paper 2011/459
Sufficient conditions for sound hashing using a truncated permutation
Joan Daemen and 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
