How to Trust Strangers: Composition of Byzantine Quorum Systems

07/23/2021
by   Orestis Alpos, et al.
0

Trust is the basis of any distributed, fault-tolerant, or secure system. A trust assumption specifies the failures that a system, such as a blockchain network, can tolerate and determines the conditions under which it operates correctly. In systems subject to Byzantine faults, the trust assumption is usually specified through sets of processes that may fail together. Trust has traditionally been symmetric, such that all processes in the system adhere to the same, global assumption about potential faults. Recently, asymmetric trust models have also been considered, especially in the context of blockchains, where every participant is free to choose who to trust. In both cases, it is an open question how to compose trust assumptions. Consider two or more systems, run by different and possibly disjoint sets of participants, with different assumptions about faults: how can they work together? This work answers this question for the first time and offers composition rules for symmetric and for asymmetric quorum systems. These rules are static and do not require interaction or agreement on the new trust assumption among the participants. Moreover, they ensure that if the original systems allow for running a particular protocol (guaranteeing consistency and availability), then so will the joint system. At the same time, the composed system tolerates as many faults as possible, subject to the underlying consistency and availability properties. Reaching consensus with asymmetric trust in the model of personal Byzantine quorum systems (Losa et al., DISC 2019) was shown to be impossible, if the trust assumptions of the processes diverge from each other. With asymmetric quorum systems, and by applying our composition rule, we show how consensus is actually possible, even with the combination of disjoint sets of processes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2019

Asymmetric Distributed Trust

Quorum systems are a key abstraction in distributed fault-tolerant compu...
research
05/18/2020

Asymmetric Byzantine Consensus

Byzantine quorum systems provide a widely used abstraction for realizing...
research
05/04/2023

ZLB, a Blockchain Tolerating Colluding Majorities

The problem of Byzantine consensus has been key to designing secure dist...
research
05/18/2020

An Algebraic Model For Quorum Systems

Quorum systems are a key mathematical abstraction in distributed fault-t...
research
06/08/2020

Consensus Beyond Thresholds: Generalized Byzantine Quorums Made Live

Existing Byzantine fault-tolerant (BFT) consensus protocols address only...
research
11/10/2022

Quorum Systems in Permissionless Network

Fail-prone systems, and their quorum systems, are useful tools for the d...
research
06/28/2019

SybilQuorum: Open Distributed Ledgers Through Trust Networks

The Sybil attack plagues all peer-to-peer systems, and modern open distr...

Please sign up or login with your details

Forgot password? Click here to reset