Publications related to Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Quarts: Quick Agreement for Real-Time Control Systems

Jean-Yves Le Boudec, Simon Bliudze, Wajeb Saab

Real-time control systems (RTCSs) tolerate delay and crash faults by replicating the controller. Each replica computes and issues setpoints to actuators over a network that might drop or delay messages. Hence, the actuators might receive an inconsistent se ...

2017

Bitcoin Meets Collective Signing

Bryan Alexander Ford, Linus Gasser, Eleftherios Kokoris Kogias, Philipp Svetolik Jovanovic, Nicolas Gailly, Ismail Khoffi

While showing great promise, Bitcoin requires users to wait tens of minutes for transactions to commit, and even then, offering only probabilistic guarantees. This paper introduces ByzCoin, a novel Byzantine consensus protocol that leverages scalable colle ...

2016

Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing

Bryan Alexander Ford, Linus Gasser, Philipp Svetolik Jovanovic, Nicolas Gailly, Ismail Khoffi

While showing great promise, Bitcoin requires users to wait tens of minutes for transactions to commit, and even then, offering only probabilistic guarantees. This paper introduces ByzCoin, a novel Byzantine consensus protocol that leverages scalable colle ...

Usenix Assoc2016

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

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

Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms

André Schiper, Pamela Isabel Delgado Borda, Zarko Milosevic, Martin Biely

We introduce Disal, a new framework that simplifies turning pseudocode of fault tolerant distributed algorithms into efficient executable code. Without proper tool support, even small amounts of pseudocode normally ends up in several thousands of lines of ...

2013

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

Generating Fast Indulgent Algorithms

Rachid Guerraoui, Seth Gilbert, Dan Alistarh

Synchronous distributed algorithms are easier to design and prove correct than algorithms that tolerate asynchrony. Yet, in the real world, networks experience asynchrony and other timing anomalies. In this paper, we address the question of how to efficien ...

Springer Verlag2012

State Machine Replication

Nuno Filipe de Sousa Santos

Since their invention more than half a century ago, computers have gone from being just an handful of expensive machines each filling an entire room, to being an integral part of almost every aspect of modern life. Nowadays computers are everywhere: in our ...

EPFL2012

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Graph Chatbot

Chat with Graph Search

Quarts: Quick Agreement for Real-Time Control Systems

Bitcoin Meets Collective Signing

Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing

Beyond One Third Byzantine Failures

Byzantine Fireflies

Byzantine Fireflies

Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms

Byzantine Agreement with Homonyms

Generating Fast Indulgent Algorithms

State Machine Replication

Quarts: Quick Agreement for Real-Time Control Systems

Enhancing Bitcoin Security and Performance with Strong Consistency via Collective Signing

Bitcoin Meets Collective Signing

Beyond One Third Byzantine Failures

Byzantine Fireflies

Byzantine Fireflies

Distal: A Framework for Implementing Fault-tolerant Distributed Algorithms

Generating Fast Indulgent Algorithms

State Machine Replication

Byzantine Agreement with Homonyms