Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits

DOI10.1145/2484239.2484271MaRDI QIDQ5176085zbMATH OpenOpenAlexWikidataFDO

Authors Dariusz R. Kowalski, Achour Mostefaoui

Publication date 2 March 2015

Published in Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2484239.2484271

zbMATH Keywords

agreement problemByzantine processconsensusEIGmessage-passing modelround-based protocolsynchronous distributed system

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Optimally efficient multi-valued byzantine agreement
• Signature-free asynchronous byzantine consensus with t < n/3 and o(n ² ) messages
• 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
• Bounds on information exchange for Byzantine agreement

Cited in

(13)

• On the message complexity of binary Byzantine agreement under crash failures
• Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
• Minimal synchrony for Byzantine consensus
• Error-free multi-valued consensus with Byzantine failures
• On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
• Bounds on information exchange for Byzantine agreement
• Modular construction of an efficient 1-bit Byzantine agreement protocol
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
• On the Validity of Consensus
• Scalable and secure computation among strangers: message-competitive Byzantine protocols
• Byzantine lattice agreement in synchronous message passing systems
• Sublinear message bounds of authenticated implicit Byzantine agreement
• Correctness and fairness of committee-based blockchains: a case study of Tendermint's repeated consensus

This page was built for publication: Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits

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