Round optimal secure multisignature schemes from lattice with public key aggregation and signature compression

DOI10.1007/978-3-030-51938-4_14zbMATH Open1504.94217OpenAlexW3039081790MaRDI QIDQ5048975FDOQ5048975

Authors: Meenakshi Kansal, Ratna Dutta 

Publication date: 9 November 2022

Published in: Progress in Cryptology - AFRICACRYPT 2020 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-51938-4_14

Recommendations

• An efficient lattice-based multisignature scheme with applications to bitcoins
• MuSig-L: lattice-based multi-signature with single-round online phase
• Compact multi-signatures for smaller blockchains
• Non-interactive multisignatures in the plain public-key model with efficient verification
• Multisignatures as Secure as the Diffie-Hellman Problem in the Plain Public-Key Model

zbMATH Keywords

latticemultisignatureshort integer solutionaccountable subgroup multisignaturepublic key aggregation

Mathematics Subject Classification ID

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

Cites Work

• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles
• The Power of Proofs-of-Possession: Securing Multiparty Signatures against Rogue-Key Attacks
• Group-oriented (t, n) threshold digital signature scheme and digital multisignature
• Title not available (Why is that?)
• Title not available (Why is that?)
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• Compact multi-signatures for smaller blockchains
• Simple Schnorr multi-signatures with applications to bitcoin
• Title not available (Why is that?)
• An efficient lattice-based multisignature scheme with applications to bitcoins
• Software speed records for lattice-based signatures
• Weaknesses in some threshold cryptosystems

Cited In (6)

• Robust subgroup multisignature with one-time public keys in order
• Cryptanalysis of a round optimal lattice-based multisignature scheme
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• \textsf{DualMS}: efficient lattice-based two-round multi-signature with trapdoor-free simulation
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• An efficient lattice-based multisignature scheme with applications to bitcoins

This page was built for publication: Round optimal secure multisignature schemes from lattice with public key aggregation and signature compression

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