• Corpus ID: 211171459

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 be thought of as a middle way between typical permissionless systems (like Bitcoin) and permissioned approaches for solving consensus (like classical BFT protocols). Unlike Bitcoin and the like, validators must be explicitly chosen by peers. Unlike permissioned protocols, there is no need for the whole system… 

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.
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.
Federated Byzantine Quorum Systems
It is shown that this setting leads to a novel variant of Byzantine quorum systems where different nodes may have different understanding of what constitutes a quorum, and correctness in the realistic setting where Byzantine nodes may lie about their trust choices is proved.
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.
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.
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.
Committee Selection is More Similar Than You Think: Evidence from Avalanche and Stellar
This paper proves that the committee selection of the Avalanche consensus protocol can be used to choose committees in the Stellar Consensus Protocol that satisfy the necessary and sufficient conditions for Byzantine agreement and suggests the existence of a "statistical taxonomy" of committee selection mechanisms in distributed consensus algorithms.