A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
On expected constant-round protocols for Byzantine agreement
Journal of Computer and System Sciences
With Finite Memory Consensus Is Easier Than Reliable Broadcast
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Information and Computation
Distributed computing with imperfect randomness
DISC'05 Proceedings of the 19th international conference on Distributed Computing
On expected constant-round protocols for byzantine agreement
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
| Hi-index | 0.00 |
A new randomized Byzantine agreement algorithm is presented. This algorithm operates in a synchronous system of n processors, at most t of which can fail. The algorithm reaches agreement in 0(t/log n) expected rounds and O(n2tf/log n) expected message bits independent of the distribution of processor failures. This performance is further improved to a constant expected number of rounds and O(n2) message bits if the distribution of processor failures is assumed to be uniform. In either event, the algorithm improves on the known lower bound on rounds for deterministic algorithms. Some other advantages of the algorithm are that it requires no cryptographic techniques, that the amount of local computation is small, and that the expected number of random bits used per processor is only one. It is argued that in many practical applications of Byzantine agreement, the randomized algorithm of this paper achieves superior performance.