Skip to main content
Definition Website Computer and Technology

Zero-Knowledge Proof

Subject: Computer and Technology noun /ˌzɪr.oʊˈnɑː.lɪdʒ ˈpruːf/ 1 definition

  1. Definition (noun)

    Entry #193 · Updated

    A Zero-Knowledge Proof (ZKP) is a cryptographic protocol in which one party (the prover) demonstrates to another party (the verifier) that a mathematical or computational statement is true without revealing any underlying secret data or witnesses. Any valid ZKP satisfies three core properties: completeness (an honest prover can always convince an honest verifier of a true statement), soundness (a dishonest prover cannot convince an honest verifier of a false statement except with negligible probability), and zero-knowledge (the verifier learns nothing beyond the truth of the statement itself). By decoupling verification from data exposure, ZKPs enable privacy-preserving authentication, confidential transactions, and verifiable off-chain computation.

    Common Forms

    • Interactive Zero-Knowledge Proofs: Require multiple rounds of live challenge-and-response communication between prover and verifier (such as the Schnorr identification protocol), meaning the resulting proof convinces only the active participant and cannot be transferred to third parties.

    • Non-Interactive Zero-Knowledge (NIZK) Proofs: Collapse interaction into a single self-contained message using a shared common reference string or the Fiat-Shamir heuristic, enabling asynchronous and publicly repeatable verification.

    • zk-SNARKs (Zero-Knowledge Succinct Non-Interactive Arguments of Knowledge): Produce compact proofs that verify in milliseconds using elliptic-curve pairings or polynomial commitments, though many designs require an initial trusted setup ceremony.

    • zk-STARKs (Zero-Knowledge Scalable Transparent Arguments of Knowledge): Eliminate trusted setups by relying solely on collision-resistant hash functions and error-correcting codes, providing post-quantum resistance and scalable proving at the cost of larger proof sizes.

    Example

    When accessing an age-restricted API, a client generates a non-interactive zero-knowledge proof from a digitally signed identity credential to prove the user's birthdate precedes the 21-year cutoff. The server verifies the proof against the issuer's public key in milliseconds and grants access without ever receiving the user's exact birthdate, name, or credential identifier.