About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
PKC 2005
Conference paper
Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order
Abstract
For many one-way homomorphisms used in cryptography, there exist efficient zero-knowledge proofs of knowledge of a preimage. Examples of such homomorphisms are the ones underlying the Schnorr or the Guillou-Quisquater identification protocols. In this paper we present, for the first time, efficient zero-knowledge proofs of knowledge for exponentiation ψ(x 1) ≒ h1x1 and multi-exponentiation homomorphisms ψ(x1, . . . , x1) ≒ h 1x1 · . . . · hlxl with h1, . . . , hl εH (i.e., proofs of knowledge of discrete logarithms and representations) where H is a group of hidden order, e.g., an RSA group. © International Association for Cryptologic Research 2005.