The Knowledge Complexity of Interactive Proof-Systems
Shafi Goldwasser, Silvio Micali, Charles Rackoff
Abstract
This seminal paper introduces the concept of zero-knowledge proofs (ZKP), a cryptographic method where one party (the prover) can demonstrate to another (the verifier) that a statement is true without revealing any information beyond the validity of the statement itself. The authors formalize the interaction between prover and verifier and establish the mathematical framework for knowledge complexity, showing that some proofs can be accomplished with zero leakage of secrets. This research is the foundational theoretical underpinning for modern privacy-preserving technologies in blockchain, including anonymous payments and scalable rollups. By demonstrating the potential for secure, private verification, this paper provided the necessary conceptual tools for the future of privacy-centric and scalable decentralized systems.
Key Findings
- 1Defined the core framework for zero-knowledge proofs.
- 2Introduced the trade-off between knowledge complexity and verifier certainty.
- 3Formalized the concept of interactive proof systems.
- 4Demonstrated the possibility of verifying computational truths without revealing secret inputs.
Topics
Citation
BibTeX
@misc{theknowledge1985,
title = {The Knowledge Complexity of Interactive Proof-Systems},
author = {Shafi Goldwasser and Silvio Micali and Charles Rackoff},
year = {1985},
howpublished = {\url{https://people.csail.mit.edu/silvio/Selected%20Scientific%20Papers/Proof%20Systems/The_Knowledge_Complexity_Of_Interactive_Proof_Systems.pdf}},
}Knowledge Explorer
Explore Related Concepts
See how The Knowledge Complexity of Interactive Proof-Systems connects to glossary terms, books, and other research in the Knowledge Graph.