Extending Binary Byzantine Agreement to Multivalued Byzantine Agreement
A binary Byzantine agreement algorithm can be extended to produce a multivalued Byzantine agreement algorithm. The resulting multivalued algorithm is cheaper than previously published algorithms when the cost of transmitting values from the multival
Main Authors: | Turpin, Russell, Coan, Brian A. |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149589 |
Similar Items
-
A Simple and Efficient Randomized Byzantine Agreement Algorithm
by: Chor, Benny, et al.
Published: (2023) -
Optimal algorithms for Byzantine agreement
by: Feldman, Paul Neil
Published: (2005) -
Very Simple and Efficient Byzantine Agreement
by: Micali, Silvio
Published: (2021) -
Very Simple and Efficient Byzantine Agreement
by: Micali, Silvio
Published: (2021) -
Multi-Party Quantum Byzantine Agreement without Entanglement
by: Xin Sun, et al.
Published: (2020-10-01)