A self-adjusting algorithm for Byzantine agreement

DOI10.1007/BF02277668MaRDI QIDQ1189860zbMATH OpenOpenAlexFDO

Authors Yi Zhao, Farokh Bastani

Publication date 27 September 1992

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02277668

zbMATH Keywords

distributed systemsfault toleranceByzantine agreementself-adjusting algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
• scientific article; zbMATH DE number 4039274
• Authenticated Algorithms for Byzantine Agreement
• Bounds on information exchange for Byzantine agreement

Cites work

• A lower bound for the time to assure interactive consistency
• An efficient algorithm for byzantine agreement without authentication
• Bounds on information exchange for Byzantine agreement
• Reaching Agreement in the Presence of Faults
• Reaching approximate agreement in the presence of faults
• Stabilization and pseudo-stabilization
• The Byzantine Generals Problem
• The Byzantine generals strike again

Cited in

(10)

• A new solution for the Byzantine agreement problem
• A highly safe self-stabilizing mutual exclusion algorithm
• Self-stabilizing Byzantine agreement
• Efficient agreement using fault diagnosis.
• On Self-stabilizing Synchronous Actions Despite Byzantine Attacks
• Structural Information and Communication Complexity
• Self-replication and Borwein-like algorithms
• Bounds on information exchange for Byzantine agreement
• scientific article; zbMATH DE number 4039274 (Why is no real title available?)
• Byzantine agreement with median validity

This page was built for publication: A self-adjusting algorithm for Byzantine agreement

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