How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design
How to Prove all NP-Statements in Zero-Knowledge, and a Methodology of Cryptographic Protocol Design
Oded Goldreich,S. Micali,A. Wigderson
1986 · DOI: 10.1007/3-540-47721-7_11
Annual International Cryptology Conference · 202 Citations
TLDR
Under the assumption that encryption functions exist, it is shown that all languages in NP possess zero-knowledge proofs and it is possible to demonstrate that a CNF formula is satisfiable without revealing any other property of the formula.