DMCA
The knowledge complexity of interactive proof systems (1989)
Cached
Download Links
- [crypto.cs.mcgill.ca]
- [www.mpi-inf.mpg.de]
- [resources.mpi-inf.mpg.de]
- DBLP
Other Repositories/Bibliography
| Venue: | |
| Citations: | 1233 - 39 self |
BibTeX
@MISC{Goldwasser89theknowledge,
author = {Shafi Goldwasser and Silvio Micali and Charles Rackoff},
title = {The knowledge complexity of interactive proof systems},
year = {1989}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
Keyphrases
interactive proof system knowledge complexity subject classification first example quadratic residuosity polynomial time proof system zero-knowledge proof additional knowledge interactive proof computational complexity theory zeroknowledge proof time polynomial zero-knowledge proof system single bit mere fact hamiltonian tour quadratic residue am key word binary representation nondeterministic polynomial time quadratic nonresiduosity proof system
