Chain Reductions for Multi-signatures and the HBMS Scheme

DOI10.1007/978-3-030-92068-5_22zbMath1514.94147OpenAlexW4206504682MaRDI QIDQ6045076

Mihir Bellare, Wei Dai

Publication date: 26 May 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-92068-5_22

zbMATH Keywords

2-round multi-signature schemeDL-based multi-signature schemes

Mathematics Subject Classification ID

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

Related Items (5)

Chopsticks: fork-free two-round multi-signatures from non-interactive assumptions ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ \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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient discrete logarithm based multi-signature scheme in the plain public key model
• Efficient signature generation by smart cards
• The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme
• Security arguments for digital signatures and blind signatures
• Compact multi-signatures for smaller blockchains
• The algebraic group model and its applications
• An efficient lattice-based multisignature scheme with applications to bitcoins
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• Two-round trip Schnorr multi-signatures via delinearized witnesses
• MuSig2: simple two-round Schnorr multi-signatures
• Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols
• The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
• Simple Schnorr multi-signatures with applications to bitcoin
• Optimal Security Proofs for Signatures from Identification Schemes
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Sequential Aggregate Signatures and Multisignatures Without Random Oracles
• 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
• Unrestricted Aggregate Signatures
• Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log

This page was built for publication: Chain Reductions for Multi-signatures and the HBMS Scheme