Publications related to Cross-chain payment protocols with success guarantees

AGGREGATHOR: Byzantine Machine Learning via Robust Gradient Aggregation

Rachid Guerraoui, El Mahdi El Mhamdi, Sébastien Louis Alexandre Rouault, Georgios Damaskinos, Arsany Hany Abdelmessih Guirguis

We present AGGREGATHOR, a framework that implements state-of-the-art robust (Byzantine-resilient) distributed stochastic gradient descent. Following the standard parameter server model, we assume that a minority of worker machines can be controlled by an a ...

2019

The Impact of RDMA on Agreement

Rachid Guerraoui, Mihail Igor Zablotchi, Naama Ben David

Remote Direct Memory Access (RDMA) is becoming widely available in data centers. This technology allows a process to directly read and write the memory of a remote host, with a mechanism to control access permissions. In this paper, we study the fundamenta ...

2019

Asynchronous Byzantine Machine Learning (the case of SGD)

Rachid Guerraoui, Mahsa Taziki, El Mahdi El Mhamdi, Rhicheek Patra, Georgios Damaskinos

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

2018

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

Highly Dynamic Distributed Computing with Byzantine Failures

Rachid Guerraoui, Anne-Marie Kermarrec, Florian Huc

This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size O(log N), each containing more than two ...

2013

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

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

Rachid Guerraoui, Eric Ruppert

We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of the system. Each agent’s memory can store O(1) bits, plus a unique identiﬁer, and O(1 ...

2009

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

The Perfectly-Synchronized Round-based Model of Distributed Computing

Rachid Guerraoui, Bastian Pochon

The perfectly-synchronized round-based model provides the powerful abstraction of crash-stop failures with atomic and synchronous message delivery. This abstraction makes distributed programming very easy.We describe a technique to automatically transform ...

2007

Cross-chain payment protocols with success guarantees

Graph Chatbot

Chat with Graph Search

AGGREGATHOR: Byzantine Machine Learning via Robust Gradient Aggregation

The Impact of RDMA on Agreement

Asynchronous Byzantine Machine Learning (the case of SGD)

Beyond One Third Byzantine Failures

Highly Dynamic Distributed Computing with Byzantine Failures

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

Abstractions for asynchronous distributed computing with malicious players

The Perfectly-Synchronized Round-based Model of Distributed Computing

The Impact of RDMA on Agreement

Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures

Abstractions for asynchronous distributed computing with malicious players

Asynchronous Byzantine Machine Learning (the case of SGD)

Highly Dynamic Distributed Computing with Byzantine Failures

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

The Perfectly-Synchronized Round-based Model of Distributed Computing

AGGREGATHOR: Byzantine Machine Learning via Robust Gradient Aggregation

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Beyond One Third Byzantine Failures