Welcome to the resource topic for 2003/225
Title:
Masking Based Domain Extenders for UOWHFs: Bounds and Constructions
Authors: Palash Sarkar
Abstract:We study the class of masking based domain extenders for UOWHFs. Our first contribution
is to show that any correct masking based domain extender for UOWHF which invokes
the compression UOWHF s times must use at least \lceil\log s\rceil masks. As a
consequence we obtain the optimality of Shoup’s algorithm among the class of masking
based domain extenders. Our second contribution is to present a new parallel domain
extender for UOWHF. The new algorithm obtains an asymptotically optimal speed-up over
the sequential algorithm and the key expansion is almost everywhere optimal, i.e., it
is optimal for almost all possible number of invocations of the compression UOWHF.
ePrint: https://eprint.iacr.org/2003/225
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .