Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

All reports by Author Xinyu Mao:

TR22-049 | 4th April 2022
Xinyu Mao, Noam Mazor, Jiapeng Zhang

Non-Adaptive Universal One-Way Hash Functions from Arbitrary One-Way Functions

Revisions: 2

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). The three major efficiency measures of these primitives are: seed length, number of calls to the one-way function, and adaptivity of these calls. Although a long ... more >>>

ISSN 1433-8092 | Imprint