Publication

Scaling Byzantine Fault Tolerance

Related publications (92)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Quantifying Endogeneity of Cryptocurrency Markets

Thomas Alois Weber, Michael Mark

In this paper we construct a “reflexivity” index for Bitcoin cryptocurrency that measures the amount of activity generated endogenously within the market. For this purpose we fit a univariate self-exciting Hawkes process with two-classes of parametric kern ...

2020

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

The Performance of Byzantine Fault Tolerant Blockchains

Vincent Gramoli

Blockchains have captured the attention of many, resulting in an abundance of new systems available for use. However, selecting an appropriate blockchain for an application is challenging due to the lack of comparative information discussing core metrics s ...

IEEE2020

ICO investors

Rüdiger Fahlenbrach, Marc André Frattaroli

We conduct a detailed analysis of investors in successful initial coin offerings (ICOs). The average ICO has 4700 contributors. The median participant contributes small amounts and many investors sell their tokens before the underlying product is developed ...

SPRINGER2020

Que Sera Consensus: Simple Asynchronous Agreement with Private Coins and Threshold Logical Clocks

Bryan Alexander Ford, Philipp Svetolik Jovanovic

It is commonly held that asynchronous consensus is much more complex, difficult, and costly than partially-synchronous algorithms, especially without using common coins. This paper challenges that conventional wisdom with que sera consensus QSC, an approac ...

2020

Essays in Financial Economics

Marc André Frattaroli

This thesis consists of three chapters that study separate subjects in the area of corporate governance and financial intermediation. In the first chapter, I study a protectionist anti-takeover law introduced in 2014 in France that covers a subset of all ...

EPFL2020

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 Consensus Number of a Cryptocurrency

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

Many blockchain-based algorithms, such as Bitcoin, implement a decentralized asset transfer system, often referred to as a cryptocurrency. As stated in the original paper by Nakamoto, at the heart of these systems lies the problem of preventing double-spen ...

ASSOC COMPUTING MACHINERY2019

Efficient Verifiable Delay Functions

Benjamin Pierre Charles Wesolowski

We construct a verifiable delay function (VDF). A VDF is a function whose evaluation requires running a given number of sequential steps, yet the result can be efficiently verified. They have applications in decentralised systems, such as the generation of ...

SPRINGER INTERNATIONAL PUBLISHING AG2019

Threshold Logical Clocks for Asynchronous Distributed Coordination and Consensus

Bryan Alexander Ford

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