Zero Knowledge
Not only can interactive proof systems solve problems not believed to be in NP, but under assumptions about the existence of one-way functions, a prover can convince the verifier of the solution without ever giving the verifier information about the solution. This is important when the verifier cannot be trusted with the full solution. At first it seems impossible that the verifier could be convinced that there is a solution when the verifier has not seen a certificate, but such proofs, known as zero-knowledge proofs are in fact believed to exist for all problems in NP and are valuable in cryptography. Zero-knowledge proofs were first mentioned in the original 1985 paper on IP by Goldwasser, Micali and Rackoff, but the extent of their power was shown by Oded Goldreich, Silvio Micali and Avi Wigderson.
Read more about this topic: Interactive Proof System
Famous quotes containing the word knowledge:
“I ... observed the great beauty of American government to be, that the simple machines of representation, carried through all its parts, gives facility for a being moulded at will to fit with the knowledge of the age; that thus, although it should be imperfect in any or all of its parts, it bears within it a perfect principle the principle of improvement.
”
—Frances Wright (1795–1852)
“A man can only attain knowledge with the help of those who possess it. This must be understood from the very beginning. One must learn from him who knows.”
—George Gurdjieff (c. 1877–1949)