Minimum disclosure proofs of knowledge
Gilles Brassard, David Chaum, Claude Crépeau · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · 1987
Protocols are given for allowing a "prover" to convince a "verifier" that the prover knows some verifiable secret information, without allowing the verifier to learn anything about the secret.The secret can be probabilistically or deterministically verifiable, and only one of the prover or the verifier need have constrained resources.This paper unifies and extends models and techniques previously put forward by the authors, and compares some independent related work.,., 1988 Academic Press, Inc.'P = [ ( p and q) xor ( q or r)] and [ ( r xor q) or ( p and r)]