Publications related to Byzantine silk

Planetary-Scale Byzantine Fault Tolerance

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

EPFL2024

Fixing by Mixing: A Recipe for Optimal Byzantine ML under Heterogeneity

Rachid Guerraoui, John Stephan, Sadegh Farhadkhani, Youssef Allouah, Nirupam Gupta, Rafaël Benjamin Pinot

Byzantine machine learning (ML) aims to ensure the resilience of distributed learning algorithms to misbehaving (or Byzantine) machines. Although this problem received significant attention, prior works often assume the data held by the machines to be homo ...

PMLR2023

Byzantine Machine Learning Made Easy By Resilient Averaging of Momentums

Rachid Guerraoui, John Stephan, Sadegh Farhadkhani, Nirupam Gupta, Rafaël Benjamin Pinot

Byzantine resilience emerged as a prominent topic within the distributed machine learning community. Essentially, the goal is to enhance distributed optimization algorithms, such as distributed SGD, in a way that guarantees convergence despite the presence ...

PMLR2022

An Equivalence Between Data Poisoning and Byzantine Gradient Attacks

Rachid Guerraoui, Sadegh Farhadkhani, Le Nguyen Hoang, Oscar Jean Olivier Villemaud

To study the resilience of distributed learning, the “Byzantine" literature considers a strong threat model where workers can report arbitrary gradients to the parameter server. Whereas this model helped obtain several fundamental results, it has sometimes ...

PMLR2022

GARFIELD: System Support for Byzantine Machine Learning (Regular Paper)

Rachid Guerraoui, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis

We present GARFIELD, a library to transparently make machine learning (ML) applications, initially built with popular (but fragile) frameworks, e.g., TensorFlow and PyTorch, Byzantine–resilient. GARFIELD relies on a novel object–oriented design, reducing t ...

IEEE2021

Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)

Rachid Guerraoui, Sadegh Farhadkhani, El Mahdi El Mhamdi, Le Nguyen Hoang, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis

We study Byzantine collaborative learning, where n nodes seek to collectively learn from each others' local data. The data distribution may vary from one node to another. No node is trusted, and f < n nodes can behave arbitrarily. We prove that collaborati ...

2021

Genuinely Distributed Byzantine Machine Learning

Rachid Guerraoui, El Mahdi El Mhamdi, Le Nguyen Hoang, Sébastien Louis Alexandre Rouault, Arsany Hany Abdelmessih Guirguis

Machine Learning (ML) solutions are nowadays distributed, according to the so-called server/worker architecture. One server holds the model parameters while several workers train the model. Clearly, such architecture is prone to various types of component ...

Association for Computing Machinery2020

Scalable Byzantine Reliable Broadcast

Rachid Guerraoui, Dragos-Adrian Seredinschi, Matej Pavlovic, Matteo Monti

Byzantine reliable broadcast is a powerful primitive that allows a set of processes to agree on a message from a designated sender, even if some processes (including the sender) are Byzantine. Existing broadcast protocols for this setting scale poorly, as ...

Schloss Dagstuhl--Leibniz-Zentrum fer Informatik2019

The Hidden Vulnerability of Distributed Learning in Byzantium

Rachid Guerraoui, El Mahdi El Mhamdi, Sébastien Louis Alexandre Rouault

While machine learning is going through an era of celebrated success, concerns have been raised about the vulnerability of its backbone: stochastic gradient descent (SGD). Recent approaches have been proposed to ensure the robustness of distributed SGD aga ...

2018

Byzantine Fireflies

Rachid Guerraoui, Alexandre David Olivier Maurer

This paper addresses the problem of synchronous beeping, as addressed by swarms of fireflies. We present Byzantine-resilient algorithms ensuring that the correct processes eventually beep synchronously despite a subset of nodes beeping asynchronously. We a ...

2015

Byzantine Agreement with Homonyms

Rachid Guerraoui, Anne-Marie Kermarrec, Eric Ruppert

So far, the distributed computing community has either assumed that all the processes of a distributed system have distinct identifiers or, more rarely, that the processes are anonymous and have no identifiers. These are two extremes of the same general mo ...

Springer2013

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Zarko Milosevic

We become increasingly dependent on online services; therefore, their availability and correct behavior become increasingly important. Software replication is a popular technique for ensuring that computer systems continue to provide a correct service even ...

EPFL2013

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

André Schiper, Martin Hutle, Fatemeh Borran

We compare in an analytical way two leader-based and decentralized algorithms (that is, algorithms that do not use a leader) for Byzantine consensus with strong validity. We show that for \emph{the algorithms we analyzed}, in most cases, the decentralized ...

IEEE2011

Generic construction of consensus algorithms for benign and Byzantine faults

André Schiper, Zarko Milosevic, Olivier Rütti

The paper proposes a generic consensus algorithm that highlights the basic and common features of known consensus algorithms. The parameters of the generic algorithm encapsulate the core differences between various consensus algorithms, including leader-ba ...

2010

Unifying Byzantine Consensus Algorithms with Weak Interactive Consistency

André Schiper, Martin Hutle, Zarko Milosevic

The paper considers the consensus problem in a partially synchronous system with Byzantine processes. In this context, the literature distinguishes authenticated Byzantine faults, where messages can be signed by the sending process (with the assumption tha ...

Springer-Verlag2009

On Locating Byzantine Attackers

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

We examine networks that employ network coding, and are subject to Byzantine attacks. We consider systems where an appropriate network error correcting scheme is employed that is able to correct (up to a certain number of) Byzantine errors. Given this setu ...

2008

Abstractions for asynchronous distributed computing with malicious players

Marko Vukolic

In modern distributed systems, failures are the norm rather than the exception. In many cases, these failures are not benign. Settings such as the Internet might incur malicious (also called Byzantine or arbitrary) behavior and asynchrony. As a result, and ...

EPFL2008