Complexity of the quorum intersection property of the Federated Byzantine Agreement System

by   Łukasz Lachowski, et al.
Jagiellonian University

A Federated Byzantine Agreement System is defined as a pair (V, Q) comprising a set of nodes V and a quorum function Q: V 2^2^V∖{∅} specifying for each node a set of subsets of nodes, called quorum slices. A subset of nodes is a quorum if and only if for each of its nodes it also contains at least one of its quorum slices. The Disjoint Quorums Problem answers the question whether a given instance of fbas contains two quorums that have no nodes in common. We show that this problem is NP-complete. We also study the problem of finding a quorum of minimal size and show it is NP-hard. Further, we consider the problem of checking whether a given subset of nodes contains a quorum for some selected node. We show this problem is P-complete and describe a method that solves it in linear time with respect to number of nodes and the total size of all quorum slices. Moreover, we analyze the complexity of some of these problems using the parametrized point of view.


page 1

page 2

page 3

page 4


Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems

We give an introduction to federated Byzantine agreement systems (FBAS) ...

Is Stellar As Secure As You Think?

Stellar is one of the top ten cryptocurrencies in terms of market capita...

Centrality of nodes in Federated Byzantine Agreement Systems

The federated Byzantine agreement system (FBAS) is a consensus model int...

Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement

This paper studies the message complexity of authenticated Byzantine agr...

Maximum Centre-Disjoint Mergeable Disks

Given a set of disks on the plane, the goal of the problem studied in th...

The Computational Complexity of Understanding Network Decisions

For a Boolean function Φ{0,1}^d→{0,1} and an assignment to its variables...

Solving 3SAT By Reduction To Testing For Odd Hole

An algorithm is given for finding the solutions to 3SAT problems. The al...

Please sign up or login with your details

Forgot password? Click here to reset