We present a Byzantine agreement protocol to address the inefficiencies inherent in multi-valued Byzantine agreement protocols, i.e., a version of the Byzantine agreement protocol where every party broadcasts its request, and at the end of the protocol, every party agrees on one of the party’s requests. The protocol we present is a validated asynchronous Byzantine agreement protocol, i.e., a party’s request must be validated by some external validity property before it is proposed for agreement. Differently from most of the MVBA protocols, we allow only a subset of total parties to broadcast their requests instead of all, and we make the subset selection stochastic each time the parties choose to broadcast a new set of requests. Then, at the time of the agreement, we choose a party from the selected subset, and the parties reach an agreement on the selected party’s broadcast. Extensive theoretical analysis shows that this approach can produce efficient output regarding messages and computation overhead, but the protocol is time-consuming.
BibTeX
@misc{cryptoeprint:2026/1106,
author = {Nasit Sarwar Sony},
title = {{AN} {EFFICIENT} {VALIDATED} {ASYNCHRONOUS} {BYZANTINE} {AGREEMENT} {PROTOCOL} {USING} {COMMITTEE}},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/1106},
year = {2026},
url = {https://eprint.iacr.org/2026/1106}
}
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。