Sciweavers

AFRICACRYPT
2009
Springer

Unifying Zero-Knowledge Proofs of Knowledge

13 years 9 months ago
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.
Ueli M. Maurer
Added 19 May 2010
Updated 19 May 2010
Type Conference
Year 2009
Where AFRICACRYPT
Authors Ueli M. Maurer
Comments (0)