Publications related to The Performance of Byzantine Fault Tolerant Blockchains

Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus

Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. This paper attempts to simplify asynchronous consensus by building atop a novel threshold logical clock abstracti ...

2019

Scaling Byzantine Fault Tolerance

Matej Pavlovic

Online services are becoming more and more ubiquitous and keep growing in scale. At the same time, they are required to be highly available, secure, energy-efficient, and to achieve high performance. To ensure these (and many other) properties, replication ...

EPFL2019

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

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

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

Implementation of a Distributed Computation Framework

Matej Pavlovic

This project aims at building a dynamic and scalable framework for Byzantine fault tolerant distributed computation. By organizing nodes of a distributed system in fault-tolerant clusters, we mask Byzantine failures of single nodes and provide an abstracti ...

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

Efficient Fail-Stop Signatures from the Factoring Assumption

Khaled Ouafi, Atefeh Mashatan

In this paper, we revisit the construction of fail-stop signatures from the factoring assumption. These signatures were originally proposed to provide information-theoretic-based security against forgeries. In contrast to classical signature schemes, in wh ...

Springer2011

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

The Performance of Byzantine Fault Tolerant Blockchains

Graph Chatbot

Chat with Graph Search

Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus

Scaling Byzantine Fault Tolerance

Asynchronous Byzantine Machine Learning (the case of SGD)

Beyond One Third Byzantine Failures

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Highly Dynamic Distributed Computing with Byzantine Failures

Implementation of a Distributed Computation Framework

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

Efficient Fail-Stop Signatures from the Factoring Assumption

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Asynchronous Byzantine Machine Learning (the case of SGD)

Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus

Timing Analysis of Leader-based and Decentralized Byzantine Consensus Algorithms

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Highly Dynamic Distributed Computing with Byzantine Failures

Beyond One Third Byzantine Failures

Timing Analysis of Leader-Based and Decentralized Byzantine Consensus Algorithms

Scaling Byzantine Fault Tolerance

Implementation of a Distributed Computation Framework

Efficient Fail-Stop Signatures from the Factoring Assumption