Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/non-Hamiltonian. In this paper a computational complexity theory of the "knowledge" contained in a proof is developed. Zero-knowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and quadratic nonresiduosity. These are the first examples of zero-knowledge proofs for languages not known to be efficiently recognizable.
CITATION STYLE
Micciancio, D., & Goldwasser, S. (2002). Interactive Proof Systems. In Complexity of Lattice Problems (pp. 195–210). Springer US. https://doi.org/10.1007/978-1-4615-0897-7_9
Mendeley helps you to discover research relevant for your work.