No fully-black-box reduction from CRHF to average-case-hard SZK

Unconditional · against fully-black-box reductions · BD19

Statement

Collision-resistant hashing does not imply hard problems in SZK in a black-box way — BD19. In particular there is no fully-black-box construction of an average-case-hard SZK problem from a collision-resistant hash function.

Notes

• From iO and one-way permutations no fully-black-box construction of hard SZK problems exists either (No fully-black-box reduction from iO + OWP to average-case-hard SZK) — BDV17.