As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

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.

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

The insertion of an InGaN underlayer (UL) is known to strongly improve the performance of InGaN/GaN quantum well (QW) based blue light emitting diodes (LEDs). However, the actual physical mechanism responsible for it is still unclear. We thus conduct a sys ...

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

Fault-tolerant computing is the art and science of building computer systems that continue to operate normally in the presence of faults. The fault tolerance field covers a wide spectrum of research area ranging from computer hardware to computer software. ...

Among all classes of faults, Byzantine faults form the most general modeling of value faults. Traditionally, in the Byzantine fault model, faults are statically attributed to a set of up to t processes. This, however, implies that in this model a process a ...

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

We consider the fault-tolerant consensus problem in radio networks with crash-prone nodes. Specifically, we develop lower bounds and matching upper bounds for this problem in single-hop radios networks, where all nodes are located within broadcast range of ...

Vehicular Networks (VNs) are emerging, among civilian applications, as a convincing instantiation of the mobile networking technology. However, security is a critical factor and a significant challenge to be met. Misbehaving or faulty network nodes have to ...

In a distributed application, high-availability of a critical online service is ensured despite failures by duplicating the vital components of the server. Whilst guaranteeing the access to the server at all times, duplication requires particular care, so ...

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Chat with Graph Search

Scalable Byzantine Reliable Broadcast

Burying non-radiative defects in InGaN underlayer to increase InGaN/GaN quantum well efficiency

Abstractions for Solving Consensus and Related Problems with Byzantine Faults

Round-Based Consensus Algorithms, Predicate Implementations and Quantitative Analysis

Consensus when all processes may be Byzantine for some time

Abstractions for asynchronous distributed computing with malicious players

Consensus and collision detectors in radio networks

Eviction of Misbehaving and Faulty Nodes in Vehicular Networks

Transformations in distributed computations and applications to set agreement