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

DOI10.1016/J.IPL.2010.10.015MaRDI QIDQ1944042zbMATH OpenOpenAlexFDO

Authors Haifeng Qian, Shouhuai Xu

Publication date 4 April 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2010.10.015

zbMATH Keywords

computational Diffie-Hellman (CDH) with bilinear maps (co-CDH)cryptographydecisional Diffie-Hellman (DDH)discrete logarithm (DL)multisignatureplain public-key modelrandom oracle model

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Tightly secure non-interactive multisignatures in the plain public key model
• Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
• Multisignature scheme based on discrete logarithms in the plain public key model
• scientific article; zbMATH DE number 721893
• Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem

Cites work

• A digital multisignature scheme using bijective public-key cryptosystems
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Advances in Cryptology - EUROCRYPT 2004
• Efficient discrete logarithm based multi-signature scheme in the plain public key model
• Efficient Identity-Based Encryption Without Random Oracles
• scientific article; zbMATH DE number 2009971 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
• Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
• Pairings for cryptographers
• Secure acknowledgment aggregation and multisignatures with limited robustness
• Security in Communication Networks
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles
• The complexity of certain multi-exponentiation techniques in cryptography
• The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Unrestricted Aggregate Signatures

Cited in

(15)

• Simple Schnorr multi-signatures with applications to bitcoin
• A practical and insider secure signcryption with non-interactive non-repudiation
• Multisignature scheme based on discrete logarithms in the plain public key model
• Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model
• Formal Security Model of Multisignatures
• Multisignatures Using Proofs of Secret Key Possession, as Secure as the Diffie-Hellman Problem
• scientific article; zbMATH DE number 721893 (Why is no real title available?)
• Tightly secure non-interactive multisignatures in the plain public key model
• scientific article; zbMATH DE number 1456814 (Why is no real title available?)
• Round optimal secure multisignature schemes from lattice with public key aggregation and signature compression
• Cryptography and Coding
• T-Spoon: tightly secure two-round multi-signatures with key aggregation
• Tightly secure non-interactive BLS multi-signatures
• Putting multi into multi-signatures: tight security for multiple signers
• Efficient discrete logarithm based multi-signature scheme in the plain public key model

This page was built for publication: Non-interactive multisignatures in the plain public-key model with efficient verification

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