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

DOI10.1007/978-3-642-03298-1_3zbMATH Open1248.94106OpenAlexW1541671717MaRDI QIDQ3392899FDOQ3392899

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
• Efficient discrete logarithm based multi-signature scheme in the plain public key model
• 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
• Title not available (Why is that?)
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Title not available (Why is that?)
• Security in Communication Networks
• A provable M-of-N signature scheme based on the BDHI-type assumption in the random oracle model
• Formal Security Model of Multisignatures
• Title not available (Why is that?)
• 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)