The Knowledge Complexity of Interactive Proof Systems.¶
Goldwasser, S., Micali, S., & Rackoff, C. (1989). The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, 18(1), 186-208.
Cited by¶
5 citations across 5 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Information Asymmetry
- Computer security and cryptography: One party knows a private key, a password, or an exploit the other lacks.
This sourceDefines zero-knowledge proofs, the cryptographic instantiation of governed information asymmetry: an informed party demonstrates possession of a secret (a private key or witness) without revealing it to a verifier who lacks it.
- Computer security and cryptography: One party knows a private key, a password, or an exploit the other lacks.
- Information Hiding
- In cryptography it is zero-knowledge proofs (prove a property without revealing the witness), secure multi-party computation, and differential privacy.
This sourceZero-knowledge proofs — proving a property without revealing the witness — the cryptographic instance of controlled crossing that exposes a verification bit while concealing internal facts.
- In cryptography it is zero-knowledge proofs (prove a property without revealing the witness), secure multi-party computation, and differential privacy.
- Verifier-Prover Asymmetry
- Zero Knowledge Proof
Domain-specific¶
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:6ffc3d82ccae · see in the full table