Cob: a leaderless protocol for parallel Byzantine agreement in incomplete networks
Saved in:
| Published in: | Distributed and Parallel Databases vol. 42, no. 2 (Jun 2024), p. 179 |
|---|---|
| Main Author: | |
| Other Authors: | , |
| Published: |
Springer Nature B.V.
|
| Subjects: | |
| Online Access: | Citation/Abstract Full Text Full Text - PDF |
| Tags: |
No Tags, Be the first to tag this record!
|
| Abstract: | In this paper we extend the Multidimensional Byzantine Agreement (MBA) Protocol, a leaderless Byzantine agreement for lists of arbitrary values, into a protocol suitable for wide gossiping networks: Cob. This generalization allows the consensus process to be run by an incomplete network of nodes provided with (non-synchronized) same-speed clocks. Not all nodes are active in every step, so the network size does not hamper the efficiency, as long as the gossiping broadcast delivers the messages to every node in reasonable time. These network assumptions model more closely real-life communication channels, so Cob may be applicable to a variety of practical problems, such as blockchain platforms implementing sharding. Cob has the same Bernoulli-like distribution that upper-bounds the number of steps as the MBA protocol. We prove its correctness and security assuming a supermajority of honest nodes in the network, and compare its performance with Algorand. |
|---|---|
| ISSN: | 0926-8782 1573-7578 |
| DOI: | 10.1007/s10619-022-07410-0 |
| Source: | Advanced Technologies & Aerospace Database |