The problem of cooperative fusion in the presence of Byzantine sensors is considered. An information theoretic formulation is used to characterize the Shannon capacity of sensor fusion. It is shown that when less than half of the sensors are Byzantine, the effect of Byzantine attack can be entirely mitigated, and the fusion capacity is identical to that when all sensors are honest. But when at ...

Distributed machine learning algorithms enable processing of datasets that are distributed over a network without gathering the data at a centralized location. While efficient distributed algorithms have been developed under the assumption of faultless networks, failures that can render these algorithms nonfunctional indeed happen in the real world. This paper focuses on the problem of Byzantin...

Permanent faults : This type of failure is persistent: it continues to exist until the faulty component is repaired or replaced. Examples of this fault are disk head crashes, software bugs, and burnt-out power supplies. Any of these faults may be either a fail-silent failure (also known as a fail-stop) or a Byzantine failure. A fail-silent fault is one where the faulty unit stops functioning an...

Setting out from the short dialogue in which Cynic philosopher Diogenes of Sinope was asked “Where are you from?” and he replied “I am a citizen world [ὃ κοσμοπολίτης; cosmopolitan]”, purpose this article is to explore cosmopolitanism Byzantine Constantinopolitan perspectives. The intention toreflect on significance for world-making European historical literature by considering it within framew...

We propose three new robust aggregation rules for distributed synchronous Stochastic Gradient Descent (SGD) under a general Byzantine failure model. The attackers can arbitrarily manipulate the data transferred between the servers and the workers in the parameter server (PS) architecture. We prove the Byzantine resilience properties of these aggregation rules. Empirical analysis shows that the ...

Asynchronous distributed machine learning solutions have proven very effective so far, but always assuming perfectly functioning workers. In practice, some of the workers can however exhibit Byzantine behavior, caused by hardware failures, software bugs, corrupt data, or even malicious attacks. We introduce Kardam, the first distributed asynchronous stochastic gradient descent (SGD) algorithm t...

International Computer Science Institute, Berkeley, CA 2007 – Present Postdoctoral Researcher, Networking Group, working with Prof. Scott Shenker, Dr. Petros Maniatis, and Dr. Sylvia Ratnasamy Diverse replication for single-machine Byzantine-fault tolerance: Investigate exploiting cores in many-core systems to defend against software attacks. Explore different isolation and software diversity m...

We propose a Byzantine Fault Tolerant variant of the Raft consensus algorithm, BFTRaft, inspired by the original Raft[1] algorithm and the Practical Byzantine Fault Tolerance algorithm[2]. BFT Raft maintains the safety, fault tolerance, and liveness properties of Raft in the presence of Byzantine faults, while also aiming towards to Raft’s goal of simplicity and understandability. We have imple...

Byzantine Agreements were first formally proposed by Lamport [8], for use in finding faulty processors in distrubuted computer networks. In this article we will use the process of finding faults to uncover traitors in secure communications networks. Maintaining reliability in trusted networks is an important application of Byzantine Agreements. Thus by introducing the fundamentals of the Byzant...

Byzantine Agreements were first formally proposed by Lamport [8], for use in finding faulty processors in distrubuted computer networks. In this article we will use the process of finding faults to uncover traitors in secure communications networks. Maintaining reliability in trusted networks is an important application of Byzantine Agreements. Thus by introducing the fundamentals of the Byzant...