Zero-knowledge (also called minimum disclosure) proof systems are indispensable wherever there is a necessity to prove the truth of a statment without revealing anything more about it. Zero-knowledge proofs involve two parties: the prover who claims that a statement is true, and the verifier who would like to be convinced that the statement is indeed true. The proof is conducted via an interaction between the parties. At the end of the protocol, the verifier is convinced only when the statement is true. If, however, the prover lies about the statement, the verifier will discover the lie with an overwhelming probability. The idea sprang out of interactive proof systems. Interactive proofs have gained a quite independent status as a part of computational complexity theory.
KeywordsEntropy Assure Tocol
Unable to display preview. Download preview PDF.