A new solution for the Byzantine agreement problem

DOI10.1016/j.jpdc.2011.06.002zbMath1225.68041OpenAlexW2037026690MaRDI QIDQ645812

Hui-Ching Hsieh, Mao-Lun Chiang

Publication date: 10 November 2011

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2011.06.002

zbMATH Keywords

fault tolerancedistributed systemByzantine agreement problem

Mathematics Subject Classification ID

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

Cites Work

• The incremental agreement
• A lower bound for the time to assure interactive consistency
• Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
• Early stopping in Byzantine agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• An efficient algorithm for byzantine agreement without authentication
• Unnamed Item