Zero-knowledge argument for simultaneous discrete logarithms
From MaRDI portal
Publication:1759659
DOI10.1007/s00453-011-9593-3zbMath1259.94046MaRDI QIDQ1759659
Sherman S. M. Chow, Jian Weng, Chang-she Ma
Publication date: 21 November 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9593-3
Diffie-Hellman problem; equality of discrete logarithms; honest-verifier zero-knowledge argument; online/offline signature; simultaneous discrete logarithms
Related Items
Threshold-directed signature scheme based on hybrid number theoretic problems, A closer look at multiple forking: leveraging (in)dependence for a tighter bound
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Secure proxy signature schemes for delegation of signing rights
- Efficient discrete logarithm based multi-signature scheme in the plain public key model
- Security arguments for digital signatures and blind signatures
- Securing threshold cryptosystems against chosen ciphertext attack
- Efficient signature schemes with tight reductions to the Diffie-Hellman problems
- Publicly Verifiable Secret Sharing
- Verifiable encryption of digital signatures and applications
- Zero-Knowledge Argument for Simultaneous Discrete Logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
