Citation

Tan, Syh Yuan and Ng, Tiong Sik and Heng, Swee Huay (2025) Efficient Fork-Free BLS Multi-signature Scheme with Incremental Signing. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 14903. pp. 250-268. ISSN 0302-9743

Full text not available from this repository.

Abstract

In this paper, we propose a new BLS multi-signature (MS) scheme that offers advantages compared to the state-of-the-art Boneh-Drijvers-Neven MS (BDN-MS) scheme. Firstly, the proposed scheme is provably secure without a forking lemma. Specifically, we show that it is unforgeable under chosen message attack (uf-cma) in the plain public key model if BLS signature is uf-cma. Moreover, the security against the rogue public key attacks of our MS scheme can be reduced to the binding security of a multi-set commitment scheme, stemming from the commit-and-verify technique underlying the proposed BLS-MS which is of independent interest. Secondly, the proposed scheme supports incremental signing, that is, a new BLS signature can be added to an existing multi-signature of the same message. Thirdly, the proposed MS scheme has a more efficient public key aggregation algorithm, resulting in approximately 42 times faster verification process than BDN-MS when considering 10,000 signers. Finally, we also show that the proposed MS scheme can be extended into an aggregate MS (AMS) scheme as in that of BDN-MS

Item Type:	Article
Uncontrolled Keywords:	multi-signature, rogue public key
Subjects:	Q Science > QA Mathematics > QA71-90 Instruments and machines
Depositing User:	Ms Rosnani Abd Wahab
Date Deposited:	06 Mar 2025 00:08
Last Modified:	06 Mar 2025 00:08
URII:	http://shdl.mmu.edu.my/id/eprint/13566

Downloads

Edit (login required)