zk- SNARKS

Zero Knowledge Succinct Non-Interactive Arguments of Knowledge

Zero Knowledge Proofs

What is a proof?

Two players: prover, verifier

Language L and statement x belongs to L

From interactive to non-interactive protocols - NIZK

Fiat Shamir Heuristic

Succinct proofs

Altogether: ZK-SNARKS

Practical applications using polynomial commitments