A Simple and Efficient Randomized Byzantine Agreement Algorithm
A new randomized Byantine agreement algorithm is presented. This algorithm operates in a synchronous systems of n processors, at most t of which can fail. The algorithm reaches agreement in O(t/log n) expected rounds and O(n^2 t/log n) expected message bits independent of the distribution of process...
| Main Authors: | , |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149076 |