Modular construction of a Byzantine agreement protocol with optimal message bit complexity
The paper deals with a new Byzantine Agreement Protocol (BAP) whose quality is described by the following measures: --- the number of processors required to tolerate at most \(t\) faults, --- the number of rounds of communication, --- the total number of message bits, --- the size of the largest message. The authors define the general transformation as the composition of two transformations, namely, from BAP to BBP (Byzantine Broadcast Protocol), and from a collection of BBPs to BAP. The new BAP protocol is constructed by recursive applying these transformations. In addition, some theorems which show the higher quality of the proposed BAP, as compared to well known BAPs, are proved. The new BAP turns out to be optimal or near optimal with respect to all quality measures.
- A lower bound for the time to assure interactive consistency
- An efficient algorithm for byzantine agreement without authentication
- Bounds on information exchange for Byzantine agreement
- Consensus algorithms with one-bit messages
- Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time
- Early stopping in Byzantine agreement
- Easy impossibility proofs for distributed consensus problems
- Efficient agreement using fault diagnosis.
- Reaching Agreement in the Presence of Faults
- Shifting gears: Changing algorithms on the fly to expedite Byzantine agreement
- The Byzantine Generals Problem
- The Byzantine generals strike again
- Efficient agreement using fault diagnosis.
- Fast consensus in networks of bounded degree.
- Performance study of Byzantine agreement protocol with artificial neural network
- Optimal extension protocols for Byzantine broadcast and agreement
- Broadcast from minicast secure against general adversaries
- Modular construction of an efficient 1-bit Byzantine agreement protocol
- Optimal time Byzantine agreement for \(t<n/8\) with linear-messages
- Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
- Efficient perfectly secure computation with optimal resilience
- Efficient perfectly secure computation with optimal resilience
- Distributed CONGEST Algorithms against Mobile Adversaries
- On broadcast in generalized network and adversarial models
- Nearly optimal parallel broadcast in the plain public key model
- \textsf{Juggernaut}: efficient crypto-agnostic Byzantine agreement
- All Byzantine agreement problems are expensive
- DARE to agree: Byzantine agreement with optimal resilience and adaptive communication
- Communication lower bounds for cryptographic broadcast protocols
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)