Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
- 1 February 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (1), 247-290
- https://doi.org/10.1137/s0097539794265232
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Efficient agreement using fault diagnosisDistributed Computing, 1993
- Modular construction of an efficient 1-bit Byzantine agreement protocolTheory of Computing Systems, 1993
- Cloture Votes:n/4-resilient Distributed Consensus int + 1 roundsTheory of Computing Systems, 1993
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreementInformation and Computation, 1992
- Consensus algorithms with one-bit messagesDistributed Computing, 1991
- The best of both worlds: guaranteeing termination in fast randomized byzantine agreement protocolsInformation Processing Letters, 1990
- Knowledge and common knowledge in a Byzantine environment: Crash failuresInformation and Computation, 1990
- Early stopping in Byzantine agreementJournal of the ACM, 1990
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- An efficient algorithm for byzantine agreement without authenticationInformation and Control, 1982