gen-define-zero-knowledge-proofs-and-give-one-short-worked-examp-f51e

Define zero-knowledge proofs and give one short worked example.

# Zero-Knowledge Proofs A **zero-knowledge proof** is a cryptographic method where one party (the prover) can convince another party (the verifier) that a statement is true, without revealing any information beyond the validity of the statement itself. ## Key Properties: 1. **Completeness**: If the statement is true, an honest verifier will be convinced 2. **Soundness**: If the statement is false, a cheating prover cannot convince the verifier (except with negligible probability) 3. **Zero-knowledge**: The verifier learns nothing except that the statement is true ## Simple Example: The Color-Blind Friend **Scenario**: You want to prove to a color-blind friend that two balls are different colors (one red, one green) without revealing which is which. **Protocol**: 1. Your friend holds both balls behind their back 2. They show you one ball, then hide both again 3. They either: (a) show the same ball, or (b) switch and show the other ball 4. You tell them whether they switched or not 5. Repeat many times (say, 20 rounds) **Why it works**: - If the balls are truly different colors, you can answer correctly 100% of the time - If the balls were the same color, you could only guess correctly 50% of the time - After 20 correct answers, the probability you're guessing is (1/2)^20 ≈ 0.0001% - Your friend becomes convinced the balls differ, but learns nothing about which color is which This demonstrates all three properties: completeness, soundness, and zero-knowledge.