“Knowledge Connectivity Requirements for Solving Byzantine Consensus with Unknown Participants”

From Navigators

(Difference between revisions)
Jump to: navigation, search
 
Line 1: Line 1:
{{Publication
{{Publication
|type=article
|type=article
-
|title=SieveQ: A Layered BFT Protection System for Critical Services
+
|title=Knowledge Connectivity Requirements for Solving Byzantine Consensus with Unknown Participants
-
|author=Miguel Garcia, Nuno Neves, Alysson Bessani
+
|author=Eduardo Adilio Pelinson Alchieri, Alysson Bessani, Fabíola Greve, Joni da Silva Fraga
-
|Project=Project:SEGRID
+
|Project=Project:SUPERCLOUD, Project:IRCoC
|ResearchLine=Fault and Intrusion Tolerance in Open Distributed Systems (FIT)
|ResearchLine=Fault and Intrusion Tolerance in Open Distributed Systems (FIT)
-
|month=jun
+
|month=mar
|year=2016
|year=2016
-
|abstract=Firewalls play a crucial role in assuring the security of today’s critical infrastructures, forming a first line of defense by being placed strategically at the front-end of the networks. Sometimes, however, they have exploitable weaknesses, allowing an adversary to bypass them in different ways. Therefore, their design should include improved resilience capabilities to allow them to operate correctly in highly adverse environments. This paper proposes SieveQ, a message queue service that protects and regulates the access to critical systems, in a way similar to an application-level firewall. SieveQ achieves fault and intrusion tolerance by employing an architecture based on two filtering layers, enabling efficient removal of invalid messages at early stages and decreasing the costs associated with Byzantine Fault-Tolerant (BFT) replication of previous solutions. Our experimental evaluation shows that SieveQ improves existing replicated-firewalls resilience in the presence of corrupted messages by faulty nodes. Furthermore, it accommodates high loads, as it is able to handle sixteen times more security events per second than what was processed by the SIEM employed in the 2012 Summer Olympic Games.
+
|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 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.
|journal=IEEE Transactions on Dependable and Secure Computing
|journal=IEEE Transactions on Dependable and Secure Computing
|note=accepted for publication
|note=accepted for publication
-
|url=http://ieeexplore.ieee.org/document/7517292/
+
|url=http://ieeexplore.ieee.org/document/7444180/
}}
}}

Latest revision as of 15:06, 16 January 2017

Eduardo Adilio Pelinson Alchieri, Alysson Bessani, Fabíola Greve, Joni da Silva Fraga

IEEE Transactions on Dependable and Secure Computing, Mar. 2016.

accepted for publication.
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 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.

Download paper

Download Knowledge Connectivity Requirements for Solving Byzantine Consensus with Unknown Participants

Export citation

BibTeX

Project(s): Project:SUPERCLOUD, Project:IRCoC

Research line(s): Fault and Intrusion Tolerance in Open Distributed Systems (FIT)

Personal tools
Navigators toolbox