Round Optimal Secure Multisignature Schemes from Lattice with Public Key Aggregation and Signature Compression

DOI10.1007/978-3-030-51938-4_14zbMath1504.94217OpenAlexW3039081790MaRDI QIDQ5048975

Ratna Dutta, Meenakshi Kansal

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

zbMATH Keywords

latticemultisignatureshort integer solutionaccountable subgroup multisignaturepublic key aggregation

Mathematics Subject Classification ID

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

Related Items (3)

Cryptanalysis of a round optimal lattice-based multisignature scheme ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices

Cites Work

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

This page was built for publication: Round Optimal Secure Multisignature Schemes from Lattice with Public Key Aggregation and Signature Compression