Optimizing trust in networks through exchange of message paths

Distributed systems are networks of nodes depending on each other. However, each network can have multiple faulty nodes, which are either malfunctioning or malicious. Bracha's algorithm allows correct nodes inside the network to agree on certain information, while tolerating a certain amount of faulty nodes. Nodes exchange Send, Echo and Ready...

Byzantine-Resilient Real-Time Reliable Broadcast on Partially Connected Topology Cases

Increasing digitalisation of society due to technical advancement has increased the appearance and size of cyber- physical systems. These systems require real-time reliable control, which comes with its challenges. These systems need reliable communication despite the presence of attacks or faulty processes and bad connections, which can disrupt...

Message efficient Byzantine Reliable Broadcast protocols on known topologies

In this paper, we consider the Reliable Communication and Byzantine Reliable Broadcast problems on partially connected networks with authenticated links. We consider the Reliable Communication (RC) problem on partially connected networks, and the Byzantine Reliable Broadcast (BRB) problem on partially and fully connected networks. Danny Dolev's...

Byzantine Reliable Broadcast on partially connected networks with signatures

In this paper, we consider Byzantine reliable broadcast on partially connected networks using signatures. Byzantine reliable broadcast in partially connected and authenticated networks can be achieved by combining two algorithms, Gabriel Bracha's double-echo broadcast protocol and Danny Dolev's reliable communication protocol. Bracha's algorithm...

Trusted Execution Environments in Byzantine-Tolerant Networks

Achieving consensus in a network is one of the most important performance bottlenecks in distributed computing. This paper takes a look at the existing protocols for achieving Byzantine Reliable Broadcast on asynchronous partially connected networks and how these protocols change to leverage the fact that some nodes have access to Trusted...

Practical Byzantine Reliable Broadcast on Partially-Connected Networks

In this paper, we consider the Byzantine reliable broadcast problem on authenticated and partially connected networks. The state-of-the-art method to solve this problem consists in combining two algorithms from the literature. Handling asynchrony and faulty senders is typically done thanks to Gabriel Bracha's authenticated double-echo...

A noise subspace approach for localization

Wireless sensor networks are becoming increasingly popular due to their low cost and wide applicability to support a large number of diverse application areas. Localization of sensor nodes is a fundamental requirement that makes the sensor data meaningful. Energy and cost constraints only allow to equip a few nodes with a GPS device and to...