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

DOI10.1007/978-3-642-03298-1_3zbMath1248.94106OpenAlexW1541671717MaRDI QIDQ3392899

Duc-Phong Le, Alban 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)

Related Items

Non-interactive multisignatures in the plain public-key model with efficient verification

Cites Work

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