Unifying Zero-Knowledge Proofs of Knowledge

Abstract. 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 equality of secret values, a protocol for proving the correctness of a Diffie-Hellman key, protocols for proving the multiplicative relation of three commitments (as required in secure multi-party computation), and protocols used in credential systems. This shows that a single simple treatment (and proof), at a high level action, can replace the individual previous treatments. Moreover, one can devise new instantiations of the protocol.

• Type: Conference
• Year: 2009
• Where: AFRICACRYPT
• Authors: Ueli M. Maurer
• Keywords: AFRICACRYPT 2009, Cryptology, Knowledge Protocol, Schnorr’s Protocol, Simple Zero-knowledge Proof