Difference between revisions of "SZK/OWF Characterization Theorem"
Jump to navigation
Jump to search
(Created page with "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 w...") |
|||
| Line 1: | Line 1: | ||
| − | + | Any problem having a computational zero-knowledge proof system can | |
be described as a problem having a statistical zero-knowledge proof plus a set | 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. | of yes instances from which we can construct a one-way function. | ||
Latest revision as of 08:52, 1 July 2020
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.
