Scholarlink

<p>Byzantine fault-tolerant (BFT) protocols enable ordered transactions among untrusted participants. Asynchronous BFT protocols are the most robust BFT protocols, but their high latency limits practical application. This latency is primarily due to the communication overhead of the reliable broadcast (RBC) protocol. To solve the high latency problem of asynchronous broadcast protocols, we first propose a novel multi-secret sharing scheme that enhances the efficiency of ciphertext segmentation and reconstruction. Besides, our core part, using our proposed multi-secret sharing scheme as a basis, constructs a new broadcast protocol, RBC-MSS, which reduces the message complexity generated by the RBC protocol to <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="11227_2025_7211_Article_IEq1.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="49" /> </InlineMediaObject> <EquationSource Format="TEX">\(O(N^2)\)</EquationSource> <EquationSource Format="MATHML"><math> <mrow> <mi>O</mi> <mo stretchy="false">(</mo> <msup> <mi>N</mi> <mn>2</mn> </msup> <mo stretchy="false">)</mo> </mrow> </math></EquationSource> </InlineEquation>. Subsequent experiments show that the latency of this algorithm is reduced by 57.41% compared to the RBC protocol and 46.31% compared to the provable broadcast (PB) protocol. When integrated with the consensus process, the throughput of the algorithm is improved by 20.11% and 12.97% compared to the Dumbo and sDumbo protocols, respectively. Furthermore, it also provides greater resistance to data leakage attacks. The protocol offers both lower communication latency and stronger security.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

RBC-MSS: asynchronous broadcasting protocol based on multi-secret sharing

  • 期刊论文

  • 发表日期：

    2025年4月22日

查看全文
  • Fenhua Bai,
  • Hongye Xu,
  • Tao Shen,
  • Kai Zeng,
  • Xiaohui Zhang,
  • Chi Zhang

摘要

Byzantine fault-tolerant (BFT) protocols enable ordered transactions among untrusted participants. Asynchronous BFT protocols are the most robust BFT protocols, but their high latency limits practical application. This latency is primarily due to the communication overhead of the reliable broadcast (RBC) protocol. To solve the high latency problem of asynchronous broadcast protocols, we first propose a novel multi-secret sharing scheme that enhances the efficiency of ciphertext segmentation and reconstruction. Besides, our core part, using our proposed multi-secret sharing scheme as a basis, constructs a new broadcast protocol, RBC-MSS, which reduces the message complexity generated by the RBC protocol to \(O(N^2)\) O ( N 2 ) . Subsequent experiments show that the latency of this algorithm is reduced by 57.41% compared to the RBC protocol and 46.31% compared to the provable broadcast (PB) protocol. When integrated with the consensus process, the throughput of the algorithm is improved by 20.11% and 12.97% compared to the Dumbo and sDumbo protocols, respectively. Furthermore, it also provides greater resistance to data leakage attacks. The protocol offers both lower communication latency and stronger security.