Tools for Proving Zero Knowledge Tools for Proving Zero Knowledge
نویسندگان
چکیده
We develop general techniques that can be used to prove the zero knowledge property of most of the known zero knowledge protocols. Those techniques consist in reducing the circuit indistinguishability of the output distributions of two probabilistic Turing machines to the indistinguishability of the output distributions of certain subroutines.
منابع مشابه
Zero-knowledge proofs of knowledge for group homomorphisms
Asimple zero-knowledge proof of knowledge protocol is presented ofwhichmany known protocols are instantiations. These include Schnorr’s protocol for proving knowledge of a discrete logarithm, the Fiat–Shamir andGuillou–Quisquater protocols for proving knowledge of a modular root, protocols for proving knowledge of representations (like Okamoto’s protocol), protocols for proving equality of secr...
متن کاملProving in Zero - Knowledge that a Committed Integer a 6 = 0 or a 6 = 0 ( mod N ) 1 )
In this paper, we propose two statistical zero-knowledge proofs for proving a 6= 0 and a 6= 0(mod N), respectively, for committed integer a. By our protocols, 1) we can construct a statistical zero-knowledge proof proving that a polynomial f(x) has degree r − 1 exactly. 2) we can provide a new method to construct disavowal protocol with statistical zero-knowledge for some undeniable signatures.
متن کاملUnifying Zero-Knowledge Proofs of Knowledge
We present a simple zero-knowledge proof of knowledge protocol of which many protocols in the literature are instantiations. These include Schnorr’s protocol for proving knowledge of a discrete logarithm, the Fiat-Shamir and Guillou-Quisquater protocols for proving knowledge of a modular root, protocols for proving knowledge of representations (like Okamoto’s protocol), protocols for proving eq...
متن کاملΣ - Protocols Continued & Introduction to Zero Knowledge
A Σ-protocol for proving equality of the discrete logarithm of two pairs of numbers is presented and used in an electronic voting scheme originally proposed in [CGS97]. Further, the notion of zero knowledge is introduced and a modified (1-bit challenge) version of Schnorr’s identification scheme is shown to be zero knowledge. 1 Proving Discrete Logarithm Equality
متن کاملProving a Theorem in Zero-Knowledge
In 1986, Manuel Blum claimed in his paper ”How to Prove a Theorem So No One Else Can Claim It” that he could apply zero-knowledge methods to proving theorems in any proof system. He sketched a proof of this result, but gave no details. We give a background of zero-knowledge proofs and examine their applicability to the propositional calculus. We then examine Blum’s claim, assuming the existence...
متن کامل