Publications related to Byzantine Fireflies

Byzantine Machine Learning Made Easy By Resilient Averaging of Momentums

Rachid Guerraoui, Nirupam Gupta, John Stephan, Sadegh Farhadkhani, 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

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

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

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 ...

Springer Berlin Heidelberg2015

Beyond One Third Byzantine Failures

Rachid Guerraoui, Anne-Marie Kermarrec, Cheng Wang

The Byzantine agreement problem requires a set of

n

processes to agree on a value sent by a transmitter, despite a subset of

b

processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in the system. It ...

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

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 ...

ACM Press2011

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

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 the algorithms we analyzed, in most cases, the decentralized variant ...

2010

Byzantine Fireflies

Graph Chatbot

Chat with Graph Search

Byzantine Machine Learning Made Easy By Resilient Averaging of Momentums

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

Scalable Byzantine Reliable Broadcast

Byzantine Fireflies

Beyond One Third Byzantine Failures

Byzantine Agreement with Homonyms

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Byzantine agreement with homonyms

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Byzantine Machine Learning Made Easy By Resilient Averaging of Momentums

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

Scalable Byzantine Reliable Broadcast

Byzantine agreement with homonyms

Byzantine Fireflies

Byzantine Agreement with Homonyms

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

Beyond One Third Byzantine Failures