A constant-size signature scheme with tighter reduction from CDH assumption

DOI10.1007/978-3-319-69659-1_8MaRDI QIDQ5044840zbMATH OpenOpenAlexFDO

Authors Kaisei Kajita, Kazuto Ogawa, Eiichiro Fujisaki

Publication date 2 November 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-69659-1_8

zbMATH Keywords

CDH assumptiondigital signaturestight security reductiontrapdoor commitment

Mathematics Subject Classification ID

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

Recommendations

• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• A signature scheme as secure as the Diffie-Hellman problem
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Confined guessing: new signatures from standard assumptions
• Short signatures from Diffie-Hellman: realizing almost compact public key

Cited in

(3)

• Waters signatures with optimal security reduction
• A signature scheme as secure as the Diffie-Hellman problem
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction

This page was built for publication: A constant-size signature scheme with tighter reduction from CDH assumption

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