The Knowledge Complexity of Interactive Proof-Systems¶
Goldwasser, S., Micali, S., & Rackoff, C. (1985). The Knowledge Complexity of Interactive Proof-Systems. ACM, 291-304.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Interactive Zero-Knowledge Protocol
- When it ends, the server is convinced yet has learned nothing usable: every transcript it saw, it could have fabricated by itself.
This sourceDefines zero knowledge through efficient simulation: the verifier learns nothing beyond validity because its view can be generated without the prover’s secret.
- When it ends, the server is convinced yet has learned nothing usable: every transcript it saw, it could have fabricated by itself.
- Zero-Knowledge Authentication Protocol
- The property being exploited — that the verifier gains conviction without gaining the data — is the zero-knowledge property itself.
This sourceIntroduces interactive proofs that convince a verifier while releasing essentially zero additional knowledge.
- The property being exploited — that the verifier gains conviction without gaining the data — is the zero-knowledge property itself.
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? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
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:7c7472bc3055 · see in the full table