Bounds on information exchange for Byzantine agreement
From MaRDI portal
Publication:3766834
DOI10.1145/2455.214112zbMath0629.68026OpenAlexW2077963568MaRDI QIDQ3766834
Danny Dolev, K. Ruediger Reischuk
Publication date: 1985
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2455.214112
Related Items (33)
Information-theoretic broadcast with dishonest majority for long messages ⋮ Robust gossiping with an application to consensus ⋮ Optimal extension protocols for Byzantine broadcast and agreement ⋮ Message-optimal protocols 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 ⋮ Reaching consensus for asynchronous distributed key generation ⋮ Asymptotically free broadcast in constant expected time via packed VSS ⋮ Round-optimal honest-majority MPC in Minicrypt and with everlasting security (extended abstract) ⋮ Efficient adaptively-secure Byzantine agreement for long messages ⋮ On elapsed time consensus protocols ⋮ Efficient Counting with Optimal Resilience ⋮ \textsc{FnF-BFT}: a BFT protocol with provable performance under attack ⋮ Communication complexity of Byzantine agreement, revisited ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ Brief Announcement: Improved Consensus in Quantum Networks ⋮ On the Validity of Consensus ⋮ Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication ⋮ Constant-Space Localized Byzantine Consensus ⋮ Fast and simple distributed consensus ⋮ Optimal time byzantine agreement for t <n/8 with linear-messages ⋮ Hundreds of impossibility results for distributed computing ⋮ A simple characterization of asynchronous computations ⋮ Modular construction of a Byzantine agreement protocol with optimal message bit complexity ⋮ On the message complexity of binary Byzantine agreement under crash failures ⋮ A self-adjusting algorithm for Byzantine agreement ⋮ Optimistically tuning synchronous Byzantine consensus: another win for null messages ⋮ Gossiping by processors prone to omission failures ⋮ Near-optimal self-stabilising counting and firing squads ⋮ Consensus under unreliable transmission ⋮ Efficient agreement using fault diagnosis. ⋮ Fast consensus in networks of bounded degree. ⋮ Efficient constructions for almost-everywhere secure computation
This page was built for publication: Bounds on information exchange for Byzantine agreement
