Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR24-095 | 23rd May 2024 15:43

A Note on Zero-Knowledge for NP and One-Way Functions

RSS-Feed




TR24-095
Authors: Yanyi Liu, Noam Mazor, Rafael Pass
Publication: 27th May 2024 00:31
Downloads: 343
Keywords: 


Abstract:

We present a simple alternative exposition of the the recent result of Hirahara and Nanashima (STOC’24) showing that one-way functions exist if (1) every language in NP has a zero-knowledge proof/argument and (2) ZKA contains non-trivial languages. Our presentation does not rely on meta-complexity and we hope it may be useful for didactic purposes.



ISSN 1433-8092 | Imprint