The Sum of Its Parts: Analysis of Federated Byzantine Agreement Systems

  title={The Sum of Its Parts: Analysis of Federated Byzantine Agreement Systems},
  author={Martin Florian and Sebastian A. Henningsen and Bj{\"o}rn Scheuermann},
Federated Byzantine Agreement Systems (FBASs) are a fascinating new paradigm in the context of consensus protocols. Originally proposed for powering the Stellar payment network, FBASs can instantiate Byzantine quorum systems without requiring out-of-band agreement on a common set of validators; every node is free to decide for itself with whom it requires agreement. Sybil-resistant and yet energy-efficient consensus protocols can therefore be built upon FBASs, and the “decentrality” possible… 

Figures from this paper

Crawling the MobileCoin Quorum System
It is found that the MobileCoin quorum system currently comprises of 7 organisations controlling a total of 10 validator nodes, and current quorum set configurations prioritise safety over liveness.
Centrality of nodes in Federated Byzantine Agreement Systems
This paper considers three different approaches for obtaining centrality measures for the nodes in an FBAS, and develops a new, problem-adapted centrality measure based on the intactness of nodes, which is an important ingredient of the FBAS model.


Fast and secure global payments with Stellar
Stellar's model, protocol, and formal verification are presented; the Stellar payment network is described; the network's performance is evaluated empirically through benchmarks and the experience with several years of production use.
Asymmetric Distributed Trust
Asymmetric Byzantine quorum systems offer a way to understand some ideas behind the Ripple and Stellar blockchain protocols, which aim at relaxing symmetric trust assumptions and permit flexible trust.
Is Stellar As Secure As You Think?
This study analyzes FBA, whose security is highly dependent on the structure of quorum slices, and demonstrates that it is not superior to the traditional BFT algorithm in terms of safety and liveness.
Complexity of the quorum intersection property of the Federated Byzantine Agreement System
This work considers the problem of checking whether a given subset of nodes contains a quorum for some selected node and describes a method that solves it in linear time with respect to number of nodes and the total size of all quorum slices.
The Stellar Consensus Protocol : A Federated Model for Internet-level Consensus
A new model for consensus called federated Byzantine agreement (FBA), which achieves robustness through quorum slices—individual trust decisions made by each node that together determine system-level quorums.
The PageRank Citation Ranking : Bringing Order to the Web
This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages.
The Sybil Attack
It is shown that, without a logically centralized authority, Sybil attacks are always possible except under extreme and unrealistic assumptions of resource parity and coordination among entities.
Byzantine quorum systems
This paper considers the arbitrary (Byzantine) failure of data repositories and presents the first study of quorum system requirements and constructions that ensure data availability and consistency despite these failures, and demonstrates quorum systems over n servers with a load of O(\frac{1}{\sqrt{n}})$, thus meeting the lower bound on load for benignly fault-tolerant quorum Systems.
Deconstructing Stellar Consensus
This paper rigorously proves correct the Stellar Consensus Protocol (SCP), with the proof giving insights into the protocol structure and its use of lower-level abstractions, and establishes a refinement between the abstract protocol and the concrete SCP that uses only finite state.
Stellar Consensus by Instantiation
This work streamline the theory behind the Stellar Network, removing the clutter of unnecessary details, and refute the conjecture that Stellar's notion of intact set is optimally fault-tolerant.