Optimal time byzantine agreement for t <n/8 with linear-messages
From MaRDI portal
Publication:5137009
DOI10.1007/s004460050012zbMath1448.68172OpenAlexW2060375394MaRDI QIDQ5137009
Amos Israeli, Arkady Zamsky, Shlomit S. Pinter
Publication date: 30 November 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004460050012
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Cites Work
- A lower bound for the time to assure interactive consistency
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time
- Early stopping in Byzantine agreement
- Bounds on information exchange for Byzantine agreement
- Reaching Agreement in the Presence of Faults
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
- Message-optimal protocols for byzantine agreement (extended abstract)