Proofs That Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems¶
Goldreich, O., Micali, S., & Wigderson, A. (1991). Proofs That Yield Nothing but Their Validity or All Languages in NP Have Zero-Knowledge Proof Systems. ACM, 38(3), 690-728.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Zero Knowledge Proof
- The graph-isomorphism protocol is the textbook rigorous instance.
This sourceGives the graph-isomorphism (and graph 3-coloring) zero-knowledge protocols with the commit-challenge-respond structure, 2^{-k} soundness error over k rounds, and simulator-based zero-knowledge.
Supported in partVerified against the work's full text
The paper presents the graph-isomorphism protocol as its worked example of zero-knowledge and proves it formally (Theorem 2), but does not call it the textbook instance.
“we exemplify the notion of zero-knowledge proof systems by presenting a zero- knowledge proof system for graph isomorphism”
- The graph-isomorphism protocol is the textbook rigorous instance.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 1 citation: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:e4a2eb0c9ebe · see in the full table