An Efficient CDH-Based Signature Scheme with a Tight Security Reduction

DOI10.1007/11535218_31MaRDI QIDQ5451046zbMATH OpenOpenAlexFDO

Authors Benoît Chevallier-Mames

Publication date 17 March 2008

Published in Advances in Cryptology – CRYPTO 2005 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11535218_31

zbMATH Keywords

discrete logarithm problemsignature schemesPublic-key cryptographyDiffie-Hellman problemEDL

Mathematics Subject Classification ID

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

Recommendations

• A constant-size signature scheme with tighter reduction from CDH assumption
• scientific article; zbMATH DE number 2009970
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
• Tight proofs for signature schemes without random oracles

Cited in

(20)

• A CDH-Based Ring Signature Scheme with Short Signatures and Public Keys
• A signature scheme with efficient proof of validity
• On the security of tag-KEM for signcryption
• A constant-size signature scheme with tighter reduction from CDH assumption
• Adaptively secure 5 round threshold signatures from \textsf{MLWE}/\textsf{MSIS} and \textsf{DL} with rewinding
• Compact structure-preserving signatures with almost tight security
• Tight security for the generic construction of identity-based signature (in the multi-instance setting)
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Pairing-free blind signatures from CDH assumptions
• A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption
• scientific article; zbMATH DE number 2009970 (Why is no real title available?)
• Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
• Efficient traceable ring signature scheme without pairings
• Iterated random oracle: a universal approach for finding loss in security reduction
• Twinkle: threshold signatures from DDH with full adaptive security
• Identity-based signatures in standard model
• Zero-knowledge argument for simultaneous discrete logarithms
• Tightly secure signatures from lossy identification schemes
• Signcryption schemes based on the Diffie-Hellman problem
• A computational Diffie-Hellman-based insider secure signcryption with non-interactive non-repudiation

This page was built for publication: An Efficient CDH-Based Signature Scheme with a Tight Security Reduction

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