gen-in-3-4-sentences-explain-zero-knowledge-proofs-state-any-key-553c

In 3-4 sentences, explain zero-knowledge proofs. State any key formula.

# Zero-Knowledge Proofs A zero-knowledge proof is a cryptographic protocol where a prover convinces a verifier that a statement is true without revealing any information beyond the statement's validity. The proof must satisfy three properties: **completeness** (if the statement is true, an honest verifier will be convinced), **soundness** (if the statement is false, no cheating prover can convince the verifier except with negligible probability), and **zero-knowledge** (the verifier learns nothing beyond the truth of the statement). A key relationship in interactive zero-knowledge proofs involves the **soundness error**: if a prover attempts to prove a false statement, the probability of fooling the verifier is at most **ε**, where ε can be made arbitrarily small through repetition, typically achieving ε ≤ (1/2)^n for n rounds. Common implementations use commitments of the form **C = g^r · h^m (mod p)** in discrete-log based systems, where the prover commits to message m with randomness r without revealing m.