Zero Knowledge cryptography is a field of study wherein maths are used to prove some prposition to be valid, without revealing any further information about the proposition.
Example application: A person may utilize a ZK proof to verify that he/she is above the legal drinking age without revealing his/her age.
A Zero Knowledge proof
Prover P Verifier V
- P interacts with V convincing him that a propostion is true
- Interaction reveals nothing beyond validity of the proposition
If proposition is true, any V might as well have generate (simulated) the interaction on his own.
No need to define "Knowledge" in order to define "zero-knowledge"
- Video Tutorial
- New Directions in Cryptography, 1976
- Public-coin zero-knowledge arguments with (almost) minimal time and space overheads, 2020
- Overview of Verifiable Computing
- Interactive Proofs
- Measuring SNARK Performance
- Applied ZK
- zkMesh Newsletter
- Crypto Regulations, Privacy and Beyond
- A Dive into Zero Knowledge
- ZK "Canon" by A16z
- PLONK Explainer by Vitalik
- PLONK ePrint
- ZK Benchmarks