International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: A Sufficient Condition and Optimal Domain Extension of UOWHF

Authors:
Mridul Nandi
Download:
URL: http://eprint.iacr.org/2003/158
Search ePrint
Search Google
Abstract: Here, we present how one can extend domain of a given Hash Family. We will give a sufficient condition for UOWHF-preserving domain extension (the extended Hash Family is UOWHF whenever the base Hash Family is UOWHF). We present also a binary tree based parallel algorithm for extending the domain of a UOWHF whose key-length expansion is optimum in a sub-class of binary tree based domain extension algorithm. We will show the optimality under an assumption.
BibTeX
@misc{eprint-2003-11872,
  title={A Sufficient Condition and Optimal Domain Extension of UOWHF},
  booktitle={IACR Eprint archive},
  keywords={Hash function, UOWHF, Domain Extension Algorithm,strongly even-free masking assignment},
  url={http://eprint.iacr.org/2003/158},
  note={ hi_mridul@yahoo.com 12450 received 7 Aug 2003, last revised 2 Feb 2004},
  author={Mridul Nandi},
  year=2003
}