Sublinear message bounds of authenticated implicit Byzantine agreement

DOI10.1016/J.TCS.2024.114888MaRDI QIDQ6646446zbMATH OpenFDO

Authors Manish Kumar, Anisur Rahaman Molla

Publication date 2 December 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2024.114888

zbMATH Keywords

Byzantine agreementcryptographic assumptionsdistributed algorithmglobal coinmessage complexityrandomized algorithm

Mathematics Subject Classification ID

Distributed systems (68M14) Cryptography (94A60)

Recommendations

• Sublinear message bounds for randomized agreement
• Sublinear-round Byzantine agreement under corrupt majority
• Optimal communication complexity of authenticated Byzantine agreement
• Optimally efficient multi-valued byzantine agreement
• Bounds on information exchange for Byzantine agreement

Cites work

• A lower bound for the time to assure interactive consistency
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
• Authenticated Algorithms for Byzantine Agreement
• Breaking the \(O(n^2)\) bit barrier, scalable Byzantine agreement with an adaptive adversary
• Communication Complexity of Byzantine Agreement, Revisited
• Distributed Computing: A Locality-Sensitive Approach
• Fast Byzantine agreement
• Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• scientific article; zbMATH DE number 6297761 (Why is no real title available?)
• Message-optimal protocols for Byzantine Agreement
• On expected constant-round protocols for Byzantine agreement
• Reaching Agreement in the Presence of Faults
• Sublinear message bounds for randomized agreement
• Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
• Synchronous Byzantine agreement with nearly a cubic number of communication bits, synchronous Byzantine agreement with nearly a cubic number of communication bits
• The Byzantine Generals Problem

Cited in

(1)

• Optimal communication complexity of authenticated Byzantine agreement

This page was built for publication: Sublinear message bounds of authenticated implicit Byzantine agreement

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