Modular construction of a Byzantine agreement protocol with optimal message bit complexity
From MaRDI portal
Publication:1186809
DOI10.1016/0890-5401(92)90004-YzbMATH Open0753.68009OpenAlexW1968010535MaRDI QIDQ1186809FDOQ1186809
Authors: Brian A. Coan, Jennifer L. Welch 
Publication date: 28 June 1992
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(92)90004-y
Recommendations
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
Cites Work
- Early stopping in Byzantine agreement
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Byzantine generals strike again
- An efficient algorithm for byzantine agreement without authentication
- A lower bound for the time to assure interactive consistency
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- Easy impossibility proofs for distributed consensus problems
- Consensus algorithms with one-bit messages
- Bounds on information exchange for Byzantine agreement
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
- Efficient agreement using fault diagnosis.
Cited In (11)
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
- Modular construction of an efficient 1-bit Byzantine agreement protocol
- Fast consensus in networks of bounded degree.
- Optimal extension protocols for Byzantine broadcast and agreement
- Performance study of Byzantine agreement protocol with artificial neural network
- Distributed CONGEST Algorithms against Mobile Adversaries
- Efficient agreement using fault diagnosis.
- Broadcast from minicast secure against general adversaries
- Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
This page was built for publication: Modular construction of a Byzantine agreement protocol with optimal message bit complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186809)
