Optimal time Byzantine agreement for t

DOI10.1007/S004460050012MaRDI QIDQ5137009zbMATH OpenOpenAlexFDO

Authors Arkady Zamsky, Amos Israeli, 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

zbMATH Keywords

distributed computingfault-toleranceByzantine agreementreconstruced traversal

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Recommendations

• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• Modular construction of an efficient 1-bit Byzantine agreement protocol
• Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
• Modular construction of a Byzantine agreement protocol with optimal message bit complexity

Cites work

• A lower bound for the time to assure interactive consistency
• An randomized Byzantine agreement protocol with constant expected time and guaranteed termination in optimal (deterministic) time
• Bounds on information exchange for Byzantine agreement
• Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
• Early stopping in Byzantine agreement
• Message-optimal protocols for byzantine agreement (extended abstract)
• Reaching Agreement in the Presence of Faults
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement

Cited in

(4)

• Modular construction of an efficient 1-bit Byzantine agreement protocol
• Byzantine agreement with optimal early stopping, optimal resilience and polynomial complexity
• A flexible formal framework for masking/demasking faults
• Expected linear round synchronization: the missing link for linear Byzantine SMR

This page was built for publication: Optimal time Byzantine agreement for \(t<n/8\) with linear-messages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5137009)