Byzantine Consensus with Unknown Participants

Authors:
Eduardo A. Alchieri;Alysson Neves Bessani;Joni Silva Fraga;Fabíola Greve
Affiliations:
Department of Automation and Systems, Federal University of Santa Catarina (UFSC), Florianópolis, Brazil;Large-Scale Informatics Systems Laboratory Faculty of Sciences, University of Lisbon, Lisbon, Portugal;Department of Automation and Systems, Federal University of Santa Catarina (UFSC), Florianópolis, Brazil;Department of Computer Science, Federal University of Bahia (UFBA), Bahia, Brazil
Venue:
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Year:
2008

Citing 15
Cited 0

Consensus in the presence of partial synchrony

Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems

Journal of the ACM (JACM)
The Byzantine Generals Problem

ACM Transactions on Programming Languages and Systems (TOPLAS)
An on-demand secure routing protocol resilient to byzantine failures

WiSE '02 Proceedings of the 1st ACM workshop on Wireless security
Practical byzantine fault tolerance and proactive recovery

ACM Transactions on Computer Systems (TOCS)
The Sybil Attack

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
An asynchronous [(n - 1)/3]-resilient consensus protocol

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Randomized Byzantine Agreements

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Secure Multipath Routing for Mobile Ad Hoc Networks

WONS '05 Proceedings of the Second Annual Conference on Wireless On-demand Network Systems and Services
Simple and Efficient Oracle-Based Consensus Protocols for Asynchronous Byzantine Systems

IEEE Transactions on Dependable and Secure Computing
Fast Byzantine Consensus

IEEE Transactions on Dependable and Secure Computing
From Consensus to Atomic Broadcast: Time-Free Byzantine-Resistant Protocols without Signatures

The Computer Journal
Knowledge Connectivity vs. Synchrony Requirements for Fault-Tolerant Agreement in Unknown Networks

DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Consensus is a fundamental building block used 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 classical networks, few studies have been conducted in order to solve it in the context of dynamic and self-organizing systems characterized by unknown networks. While in a classical network the set of participants is static and known, in a scenario of unknown networks, the set and number of participants are previously unknown. This work goes one step further and 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 can behave maliciously. This paper presents a solution for BFT-CUP that does not require digital signatures. The algorithms are shown to be optimal in terms of synchrony and knowledge connectivity among participants in the system.