Interactivity and Uses
Modern applications: zk-SNARKs
Zero-knowledge proofs are not just a theoretical curiosity. They are today deployed in very real systems, from authentication to digital currencies.
Authentication without exposing the password
The most direct use case: proving to a server that you know its password without ever transmitting it. The server neither stores nor receives the secret; it only verifies a proof. The result: even if the server is hacked or the traffic is spied on, the password appears nowhere. A whole class of data breaches is eliminated.
Privacy on the blockchain
A public blockchain is by nature transparent: everyone sees all transactions, amounts and addresses included. This is a privacy problem.
Zero-knowledge proofs make it possible to resolve this dilemma. The cryptocurrency Zcash is the emblematic example: a user can prove that a transaction is valid (the funds exist, are not spent twice, the balance is respected) without revealing the sender, the recipient, or the amount.
Transaction classique (Bitcoin) :
Alice --[ 5 pieces, visibles ]--> Bob (tout le monde voit)
Transaction confidentielle (Zcash, zk) :
??? --[ preuve de validite ]--> ???
montant cache, adresses cachees
mais la validite est PROUVEE et verifiable
Non-interactive proofs: zk-SNARKs and zk-STARKs
The challenge-response scheme assumes a live dialogue between prover and verifier, with several back-and-forth exchanges. On a blockchain, this is impractical: the prover wants to produce a single proof, publishable once and for all, that anyone can verify later, on their own.
This is the role of non-interactive proofs. The best known:
- zk-SNARK (Zero-Knowledge Succinct Non-interactive ARgument of Knowledge): very short proofs that are fast to verify; used by Zcash.
- zk-STARK: more recent, without an initial "trusted setup" and considered quantum-resistant.
| Type | Interactive? | Where | Strength |
|---|---|---|---|
| Ali Baba cave | yes, several rounds | teaching | intuitive |
| zk-SNARK | no, single proof | Zcash, Ethereum | tiny proofs |
| zk-STARK | no, single proof | scaling | no trusted setup |
The word succinct is essential: a proof can concern an enormous computation while fitting in a few hundred bytes, verifiable in milliseconds. This is what makes these techniques usable at scale, including for compressing thousands of transactions (the rollups on Ethereum).
In summary
- Authentication: proving your identity without transmitting or storing the password.
- Privacy on the blockchain: Zcash proves that a transaction is valid without revealing amounts or addresses.
- zk-SNARKs and zk-STARKs are non-interactive proofs: a single, short proof, verifiable by everyone, without dialogue — hence their massive use in blockchains.

