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

DOI10.1007/11535218_31zbMath1145.94461OpenAlexW1606603454MaRDI QIDQ5451046

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)

Related Items (12)

Tightly secure signatures from lossy identification schemes ⋮ A pairing-free signature scheme from correlation intractable hash function and strong Diffie-Hellman assumption ⋮ Efficient traceable ring signature scheme without pairings ⋮ Iterated Random Oracle: A Universal Approach for Finding Loss in Security Reduction ⋮ Tight security for the generic construction of identity-based signature (in the multi-instance setting) ⋮ Signcryption Schemes Based on the Diffie–Hellman Problem ⋮ A Signature Scheme with Efficient Proof of Validity ⋮ Zero-knowledge argument for simultaneous discrete logarithms ⋮ Compact structure-preserving signatures with almost tight security ⋮ Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model ⋮ Identity-based signatures in standard model ⋮ On the Security of Tag-KEM for Signcryption

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