Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model

DOI10.1007/978-3-642-03298-1_3MaRDI QIDQ3392899zbMATH OpenOpenAlexFDO

Authors Duc-Phong Le, A. Gabillon, Alexis Bonnecaze

Publication date 18 August 2009

Published in Pairing-Based Cryptography – Pairing 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03298-1_3

Mathematics Subject Classification ID

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

Recommendations

• Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
• Tightly secure non-interactive multisignatures in the plain public key model
• Non-interactive multisignatures in the plain public-key model with efficient verification
• Multisignature scheme based on discrete logarithms in the plain public key model
• scientific article; zbMATH DE number 2009970
• Efficient discrete logarithm based multi-signature scheme in the plain public key model
• Security for Signcryption: The Multi-User Model
• Security of signature schemes in a multi-user setting
• Computational Science and Its Applications – ICCSA 2004
• Progress in Cryptology – Mycrypt 2005

Cites work

• scientific article; zbMATH DE number 1942431 (Why is no real title available?)
• scientific article; zbMATH DE number 2009970 (Why is no real title available?)
• scientific article; zbMATH DE number 2009971 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• A digital multisignature scheme using bijective public-key cryptosystems
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Improving the exact security of digital signature schemes
• Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
• Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
• The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
• Unrestricted Aggregate Signatures

Cited in

(16)

• Efficient discrete logarithm based multi-signature scheme in the plain public key model
• Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
• Tightly secure non-interactive multisignatures in the plain public key model
• Round optimal secure multisignature schemes from lattice with public key aggregation and signature compression
• Progress in Cryptology – Mycrypt 2005
• scientific article; zbMATH DE number 721893 (Why is no real title available?)
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• scientific article; zbMATH DE number 697807 (Why is no real title available?)
• Security in Communication Networks
• Formal Security Model of Multisignatures
• A provable M-of-N signature scheme based on the BDHI-type assumption in the random oracle model
• scientific article; zbMATH DE number 2222200 (Why is no real title available?)
• Non-interactive multisignatures in the plain public-key model with efficient verification
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• Secure acknowledgment aggregation and multisignatures with limited robustness
• Multisignature scheme based on discrete logarithms in the plain public key model

This page was built for publication: Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model

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