Zero-knowledge proof
A zero-knowledge proof is a cryptographic protocol in which a prover demonstrates a statement’s truth without revealing information beyond its validity.
Real-World Cryptography
A zero-knowledge proof is a cryptographic proof in which a prover demonstrates that a statement is true without revealing the underlying secret information beyond its validity.
- How it is used
- Proves knowledge or correct computation while keeping selected secrets, inputs, or outputs hidden.
- How deep it goes
- Builds an interactive Schnorr protocol from a broken masking attempt, then derives non-interactive proofs and general-purpose applications.
- Examples
- Uses domain ownership, Schnorr’s algebraic protocol, Sudoku, confidential transactions, and fixed-size blockchain-history proofs.
- What you can do after
- Evaluate how proofs preserve secrecy, distinguish interactive from non-interactive protocols, and recognize applications in signatures and cryptocurrencies.
Read how Real-World Cryptography explains zero-knowledge proof →
Elliptic Curve Cryptography for Developers
A zero-knowledge proof is a cryptographic protocol that lets a prover demonstrate that a statement is true or that secret information is known without revealing the secret information itself.
- How it is used
- Enables private verification of certificates, blockchain transactions, and sensitive financial or medical claims.
- How deep it goes
- Develops interactive and noninteractive proofs through zk-SNARKs, QAP gates, interpolants, CRS setup, and pairing-based verification.
- Examples
- Uses age verification, Ali Baba’s cave, blockchain transactions, and a medical-record QAP with medicine, dose, and patient inputs.
- What you can do after
- Evaluate/understand how a prover establishes knowledge without revealing a witness, including the role of QAPs and CRS-based verification.
Read how Elliptic Curve Cryptography for Developers explains zero-knowledge proof →
First-Party Data Activation
A cryptographic proof that demonstrates the truth of a statement without revealing the underlying information beyond that fact.
- How it is used
- Supports privacy-centric marketing by verifying customer attributes while limiting access to personal data.
- How deep it goes
- Defines privacy-preserving verification and its marketing role, but does not explain cryptographic internals or implementation steps.
- Examples
- Uses age-related attribute verification without revealing an exact birthdate as the central privacy example.
- What you can do after
- Apply it to privacy-preserving customer interactions and evaluate its governance, vendor, and integration requirements.
Read how First-Party Data Activation explains zero-knowledge proof →
Related concepts
- non-interactive zero-knowledge proofcontrasts with · A non-interactive zero-knowledge proof is a zero-knowledge proof generated and verified without online message exchange between the prover and verifier.
- general-purpose zero-knowledge proofincludes · A zero-knowledge proof system capable of proving the correct execution of general computations or programs, potentially while hiding selected inputs or outputs.
- proof of knowledgekind of · A proof of knowledge is a cryptographic proof in which a prover demonstrates knowledge of a witness satisfying a specified statement.
- cryptocurrencyused by · A cryptocurrency is a digital asset whose ownership and transfers are secured and recorded using cryptographic mechanisms, typically through a distributed ledger.
- bilinear pairinguses · A bilinear pairing is a map from two groups into a third group that preserves the group operation in each argument separately.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.