Paper 2026/2894

BMuSig-L: Blind Multi-Signature from Lattice

Anirban Chakraborty, University of Warsaw
Mriganka Dey, Institute for Advancing Intelligence, TCG CREST, Ramakrishna Mission Vivekananda Educational Research Institute, Belur
Nikita Dey, Institute for Advancing Intelligence, TCG CREST, AcSIR, India
Avijit Dutta, Institute for Advancing Intelligence, TCG CREST, AcSIR, India
Subhabrata Samajder, Institute for Advancing Intelligence, TCG CREST
Abstract

Blind signatures and multi-signatures are two fundamental cryptographic primitives for privacy-preserving decentralized protocols. A blind signature enables a user to obtain a signature on a message from a signer while keeping the message hidden from the signer. Moreover, the signer cannot subsequently link the resulting signature to the corresponding signing session. In contrast, a multi-signature scheme allows a group of signers to jointly generate a single signature on a message. Blind multi-signatures, a primitive recently introduced by Karantaidou et al. (AsiaCCS 2024), combine the advantages of both techniques. They enable a user to obtain a joint signature from a group of signers while ensuring that the message remains hidden from every signer and that colluding signers cannot later link the final signature to the corresponding signing session. Recently, Bisht et al. proposed $\textsf{BMuSig2}$ (AsiaCCS 2026), a Schnorr-compatible blind multi-signature scheme whose security is based on the hardness of the discrete logarithm problem. In this paper, we present $\textsf{BMuSig-L}$, a lattice-based, two-round, concurrently secure blind multi-signature scheme. Our construction builds upon the lattice-based multi-signature scheme $\textsf{MuSig-L}$ (CRYPTO 2022), the concurrently secure blind signature scheme of Fuchsbauer and Wolf (CRYPTO 2024), which employs non-interactive zero-knowledge arguments and public-key encryption, and a knowledge-sound non-interactive argument system. We prove that $\textsf{BMuSig-L}$ is one-more unforgeable under the assumptions of the unforgeability of $\textsf{MuSig-L}$, the computational soundness of the underlying non-interactive zero-knowledge proof system, and the knowledge soundness of the employed non-interactive argument of knowledge. Finally, we present a prototype implementation of $\textsf{BMuSig-L}$ and evaluate its performance in terms of signature size and verification time.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
Keywords
Blind SignatureMulti-SignatureBlind Multi-SignatureMuSig-LLaBRADOR
Contact author(s)
anirban2chakrabarti @ gmail com
mriganka dey 86 @ tcgcrest org
nikita dey 127 @ tcgcrest org
avijit dutta @ tcgcrest org
subhabrata samajder @ tcgcrest org
History
2026-11-19: approved
2026-11-14: received
See all versions
Short URL
https://ia.cr/2026/2894
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2026/2894,
      author = {Anirban Chakraborty and Mriganka Dey and Nikita Dey and Avijit Dutta and Subhabrata Samajder},
      title = {{BMuSig}-L: Blind Multi-Signature from Lattice},
      howpublished = {Cryptology {ePrint} Archive, Paper 2026/2894},
      year = {2026},
      url = {https://eprint.iacr.org/2026/2894}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.