Process / pipelineInteractive proof systems
Zero-Knowledge Proof
A zero-knowledge proof is a cryptographic protocol in which a prover can convince a verifier that a statement is true without revealing any additional information beyond the truth of the statement. Introduced by Goldwasser, Micali, and Rackoff in 1985, zero-knowledge proofs have profound applications in authentication, privacy-preserving verification, and blockchain systems.
Open in MethodMindSoonVideoSoon
Read the full method
Members only
Sign inSign in with a free account to read this section.
Sources
- Goldwasser, S., Micali, S., & Rackoff, C. (1985). The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1), 186–208. DOI: 10.1137/0218012 ↗
- Ben-Or, M., Goldwasser, S., Kilian, J., & Wigderson, A. (1988). Multi-prover interactive proofs: How to remove intractability assumptions. Proceedings of the 20th ACM STOC, 113–131. DOI: 10.1145/62212.62223 ↗
- Groth, J. (2016). On the size of pairing-based non-interactive arguments. Advances in Cryptology – EUROCRYPT 2016, 305–326. DOI: 10.1007/978-3-662-49896-5_11 ↗