## CryptoDB

### Paper: Construction of UOWHF: Tree Hashing Revisited

Authors: Palash Sarkar URL: http://eprint.iacr.org/2002/058 Search ePrint Search Google We present a binary tree based parallel algorithm for extending the domain of a UOWHF. The key length expansion is $2m$ bits for $t=2$; $m(t+1)$ bits for $3\leq t\leq 6$ and $m\times(t+\lfloor\log_2 (t-1)\rfloor)$ bits for $t\geq 7$, where $m$ is the length of the message digest and $t\geq 2$ is the height of the binary tree.
##### BibTeX
@misc{eprint-2002-11582,
title={Construction of UOWHF: Tree Hashing Revisited},
booktitle={IACR Eprint archive},
keywords={UOWHF, hash function, binary tree},
url={http://eprint.iacr.org/2002/058},
note={ palash@isical.ac.in 12464 received 12 May 2002, last revised 16 Feb 2004},
author={Palash Sarkar},
year=2002
}