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:
“On a huge hill,
Cragged, and steep, Truth stands, and he that will
Reach her, about must, and about must go;
And what the hill’s suddenness resists, win so;
Yet strive so, that before age, death’s twilight,
Thy Soul rest, for none can work in that night.
To will, implies delay, therefore now do:
Hard deeds, the body’s pains; hard knowledge too
The mind’s endeavours reach, and mysteries
Are like the Sun, dazzling, yet plain to all eyes.”
—John Donne (1572–1631)
“It is not when truth is dirty, but when it is shallow, that the lover of knowledge is reluctant to step into its waters.”
—Friedrich Nietzsche (1844–1900)