Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
E. Bangerter,J. Camenisch,U. Maurer
2005 · DOI: 10.1007/978-3-540-30580-4_11
International Conference on Theory and Practice of Public Key Cryptography · 46 Citations
TLDR
This paper presents, for the first time, efficient zero-knowledge proofs of knowledge for exponentiation ψ(x1)≐h1x−1 and multi-exponentiation homomorphisms