58146
doi
10.1109/TDSC.2016.2548460
oai:zenodo.org:58146
user-supercloud
Bessani, Alysson
University of Lisboa, FCUL
Greve, Fabiola
University of Lisboa, FCUL
da Silva Fraga, Joni
University of Lisboa, FCUL
Knowledge Connectivity Requirements for Solving Byzantine Consensus with Unknown Participants
Alchieri, Eduardo Adilio Pelinson
University of Brasılia
info:eu-repo/semantics/openAccess
Creative Commons Attribution Non Commercial Share Alike 4.0 International
https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
Distributed Agreement, Consensus with Unknown Participants, Byzantine Fault Tolerance, Self-organizing Systems.
<p>Consensus is a fundamental building block to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being widely studied in the context of standard networks, few studies have been conducted in order to solve it in dynamic and self-organizing systems characterized by unknown networks. While in a standard network the set of participants is static and known, in an unknown network, such set and number of participants are previously unknown. This work studies the problem of Byzantine Fault-Tolerant Consensus with Unknown Participants, namely BFT-CUP. This new problem aims at solving consensus in unknown networks with the additional requirement that participants in the system may behave maliciously. It presents the necessary and sufficient knowledge connectivity conditions in order to solve BFT-CUP under minimal synchrony requirements. In this way, it proposes algorithms that are shown to be optimal in terms of synchrony and knowledge connectivity among participants in the system.</p>
Zenodo
2016-03-30
info:eu-repo/semantics/article
638947
user-supercloud
1579540242.233161
1100299
md5:2d7124a71dcd9d619abf8a1eb8efaa69
https://zenodo.org/records/58146/files/SC-Knowledge-connectivity-requirements-for-solving-byzantine-consensus-with-unknown-participants-2016.pdf
public
IEEE Transactions on Dependable and Secure Computing
PP
99
1
2016-03-30