Zero-knowledge argument for simultaneous discrete logarithms

DOI10.1007/S00453-011-9593-3MaRDI QIDQ1759659zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

Diffie-Hellman problemequality of discrete logarithmshonest-verifier zero-knowledge argumentonline/offline signaturesimultaneous discrete logarithms

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Zero-knowledge argument for simultaneous discrete logarithms
• scientific article; zbMATH DE number 4057443
• Public Key Cryptography - PKC 2006
• Batch proofs of partial knowledge
• Unifying Zero-Knowledge Proofs of Knowledge

Cites work

• scientific article; zbMATH DE number 2009970 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 1440890 (Why is no real title available?)
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• Efficient discrete logarithm based multi-signature scheme in the plain public key model
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Practical threshold signatures
• Publicly verifiable secret sharing
• Secure proxy signature schemes for delegation of signing rights
• Securing threshold cryptosystems against chosen ciphertext attack
• Security arguments for digital signatures and blind signatures
• Verifiable encryption of digital signatures and applications
• Zero-knowledge argument for simultaneous discrete logarithms

Cited in

(5)

• Information Security and Cryptology - ICISC 2005
• Threshold-directed signature scheme based on hybrid number theoretic problems
• A closer look at multiple forking: leveraging (in)dependence for a tighter bound
• Precise zero-knowledge arguments with poly-logarithmic efficiency
• Zero-knowledge argument for simultaneous discrete logarithms

This page was built for publication: Zero-knowledge argument for simultaneous discrete logarithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1759659)