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.

Type

Journal article

Intellectual base

Primary research

Year

1991

DOI

10.1145/116825.116852

Link

https://doi.org/10.1145/116825.116852

Cited from

computer_science

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.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:e4a2eb0c9ebe · see in the full table