Publication

Scalable Byzantine Reliable Broadcast

Related publications (69)

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.

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

Bitcoin Meets Collective Signing

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

2016

Systems and methods for tracking interacting objects

Pascal Fua, François Fleuret, Engin Türetken, Xinchao Wang

Systems and methods for tracking interacting objects may acquire, with a sensor, and two or more images associated with two or more time instances. A processor may generate image data from the two or more images. The processor may apply an extended Probabi ...

2015

The impact of customer behavior models on revenue management systems

Shadi Sharif Azadeh

Revenue management (RM) can be considered an application of operations research in the transportation industry. For these service companies, it is a difficult task to adjust supply and demand. In order to maximize revenue, RM systems display demand behavio ...

2015

Asymptotically Optimal Matching of Multiple Sequences to Source Distributions and Training Sequences

Jayakrishnan Unnikrishnan

Consider a finite set of sources, each producing independent identically distributed observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources ...

Institute of Electrical and Electronics Engineers2015

In this paper we study the speed of infection spread and the survival of the contact process in the random geometric graph G = G (n, r(n), f) of n nodes independently distributed in S = -1/2, 1/2 according to a certain density f(.). In the first part ...

Applied Probability Trust2015

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

Many state-machine Byzantine Fault Tolerant (BFT) protocols have been introduced so far. Each protocol addressed a different subset of conditions and use-cases. However, if the underlying conditions of a service span different subsets, choosing a single pr ...

IEEE2015

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

2015

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