Topic
Universal one-way hash function
About: Universal one-way hash function is a research topic. Over the lifetime, 2 publications have been published within this topic receiving 99 citations. The topic is also known as: UOWHF.
Papers
8 Nov 2021
TL;DR: In this paper, the three major efficiency measures are: the seed length, the call complexity to the one-way function, and the adaptivity of these calls; however, the optimal efficiency of these constructions is not yet fully understood: there exist gaps between the known upper bound and the known lower bound for black box constructions.
Abstract: Two of the most useful cryptographic primitives that can be constructed from one-way functions are pseudorandom generators (PRGs) and universal one-way hash functions (UOWHFs). In order to implement them in practice, the efficiency of such constructions must be considered. The three major efficiency measures are: the seed length, the call complexity to the one-way function, and the adaptivity of these calls. Still, the optimal efficiency of these constructions is not yet fully understood: there exist gaps between the known upper bound and the known lower bound for black-box constructions.
30 Oct 1989
TL;DR: Very efficient constructions, based on the intractability of the subset sum problem for certain dimensions, are shown for a pseudorandom generator and for a universal one-way hash function.
Abstract: Very efficient constructions, based on the intractability of the subset sum problem for certain dimensions, are shown for a pseudorandom generator and for a universal one-way hash function. (Pseudorandom generators can be used for private key encryption, and universal one-way hash functions for signature schemes). The increase in efficiency in the construction is due to the fact that many bits can be generated/hashed with one application of the assumed one-way function. All the constructions can be implemented in NC using an optimal number of processors. >
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 1 |
| 1989 | 1 |