# How to Trust Strangers: Composition of Byzantine Quorum Systems

@inproceedings{Alpos2021HowTT,
title={How to Trust Strangers: Composition of Byzantine Quorum Systems},
author={Orestis Alpos and Christian Cachin and Luca Zanolini},
booktitle={DISC},
year={2021}
}
• Published in DISC 2021
• Computer Science
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… Expand

#### References

SHOWING 1-10 OF 19 REFERENCES
Asymmetric Byzantine Consensus
• Computer Science
• ArXiv
• 2020
This work shows how to realize consensus protocols with asymmetric trust in partially synchronous systems; it generalizes the consensus algorithm underlying PBFT and uses digital signatures, and achieves optimal resilience. Expand
Asymmetric Distributed Trust
• Computer Science
• OPODIS
• 2019
Asymmetric Byzantine quorum systems that model subjective trust are introduced and protocols that implement abstractions of shared memory and broadcast primitives with processes prone to Byzantine faults and asymmetric trust are presented. Expand
The Stellar Consensus Protocol : A Federated Model for Internet-level Consensus
This paper introduces a new model for consensus called federated Byzantine agreement (FBA). FBA achieves robustness through quorum slices—individual trust decisions made by each node that togetherExpand
Dynamic byzantine quorum systems
• Computer Science
• Proceeding International Conference on Dependable Systems and Networks. DSN 2000
• 2000
Protocols for dynamically raising and lowering the resilience threshold of a quorum-based Byzantine fault-tolerant data service in response to current information on the number of server failures are presented. Expand
Secure Protocols with Asymmetric Trust
• Computer Science
• ASIACRYPT
• 2007
This work introduces a more general model, the asymmetric-trust model, wherein every party is allowed to trust in a different, personally customized adversary structure, and shows a general composition theorem for protocols with asymmetric trust. Expand
Byzantine quorum systems
• Engineering, Computer Science
• Distributed Computing
• 1998
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. Expand
Flexible Byzantine Fault Tolerance
• Computer Science
• CCS
• 2019
A synchronous BFT protocol in which only the commit step requires to know the network delay bound and thus replicas execute the protocol without any synchrony assumption is introduced, and a notion called Flexible Byzantine Quorums is introduced by dissecting the roles of different quorums in existing consensus protocols. Expand
The load and availability of Byzantine quorum systems
• Computer Science
• PODC '97
• 1997
This paper considers a hybrid fault model allowing benign failures in addition to the Byzantine ones, and presents four novel constructions for b-masking quorum systems in this model, each of which has optimal load or optimal availability. Expand
The latest gossip on BFT consensus
• Computer Science
• ArXiv
• 2018
Tendermint is presented, a new protocol for ordering events in a distributed network under adversarial conditions that modernizes classic academic work on the subject and simplifies the design of the BFT algorithm by relying on a peer-to-peer gossip protocol among nodes. Expand
Practical byzantine fault tolerance and proactive recovery
• Computer Science
• TOCS
• 2002
A new replication algorithm, BFT, is described that can be used to build highly available systems that tolerate Byzantine faults and is used to implement the first Byzantine-fault-tolerant NFS file system, BFS. Expand