SZK/OWF Characterization Theorem

From zkstacks

Revision as of 08:52, 1 July 2020 by Srikar (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Any problem having a computational zero-knowledge proof system can be described as a problem having a statistical zero-knowledge proof plus a set of yes instances from which we can construct a one-way function.

Retrieved from "http://161.35.113.184/index.php?title=SZK/OWF_Characterization_Theorem&oldid=56"