Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order (2005)
| Venue: | In PKC 2005, LNCS 3386 |
| Citations: | 9 - 6 self |
BibTeX
@INPROCEEDINGS{Bangerter05efficientproofs,
author = {Endre Bangerter and Jan Camenisch and Ueli Maurer},
title = {Efficient proofs of knowledge of discrete logarithms and representations in groups with hidden order},
booktitle = {In PKC 2005, LNCS 3386},
year = {2005},
pages = {154--171},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. For many one-way homomorphisms used in cryptography, there exist efficient zeroknowledge 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 expo-nentiation ψ(x1). = h x1 1 and multi-exponentiation homomorphisms ψ(x1,..., xl). = h x1 1 ·... · h x l l 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. 1
