Proving Without Revealing

Cryptography · Axiom Academy

INTRO Proving Without Revealing Discover the magic of zero-knowledge proofs through interactive examples. Imagine you need to prove you know a secret, but you can't reveal the secret itself. Sounds impossible, right? Can you prove you know something without revealing what you know? This is the core idea behind zero-knowledge proofs - one of the most powerful and mysterious tools in modern cryptography. Let's start with a playful example. Can you prove you found Waldo without pointing to him? The Challenge: Find Waldo in the crowd below! Example 2: Proving You're Over 21 Here's a real-world scenario: proving your age without revealing your birthdate. Traditional Method: Enter your birthdate to prove you're over 21 Example 3: Proving You Know a Password How can you prove you know a password without typing it or revealing it? The Problem: When you type a password, it must be transmitted and verified A method that allows one party (the prover) to prove to another party (the verifier) that a statement is true, without revealing any information beyond the validity of the statement itself. 1. Completeness: If the statement is true, an honest prover can convince the verifier. 2. Soundness: If the statement is false, no cheating prover can convince the verifier. 3. Zero-Knowledge: The verifier learns nothing except that the statement is true.

This is the written version of the interactive lesson above. See the full Cryptography course.