All You Need is DAG

02/16/2021
by   Idit Keidar, et al.
0

We present DAG-Rider, the first asynchronous Byzantine Atomic Broadcast protocol that achieves optimal resilience, optimal amortized communication complexity, and optimal time complexity. DAG-Rider is post-quantum safe and ensures that all messages proposed by correct processes eventually get decided. We construct DAG-Rider in two layers: In the first layer, processes reliably broadcast their proposals and build a structured Directed Acyclic Graph (DAG) of the communication among them. In the second layer, processes locally observe their DAGs and totally order all proposals with no extra communication.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/26/2020

Optimal Communication Complexity of Byzantine Consensus under Honest Majority

Communication complexity is one of the most important efficiency metrics...
research
04/14/2023

Chop Chop: Byzantine Atomic Broadcast to the Network Limit

At the heart of state machine replication, the celebrated technique enab...
research
12/13/2021

Quick Order Fairness

Leader-based protocols for consensus, i.e., atomic broadcast, allow some...
research
01/12/2019

Byzantine Consensus under Local Broadcast Model: Tight Sufficient Condition

In this work we consider Byzantine Consensus on undirected communication...
research
06/07/2023

Dynamic Probabilistic Reliable Broadcast

Byzantine reliable broadcast is a primitive that allows a set of process...
research
05/10/2023

Let It TEE: Asynchronous Byzantine Atomic Broadcast with n ≥ 2f+1

Asynchronous Byzantine Atomic Broadcast (ABAB) promises, in comparison t...
research
07/03/2018

RT-ByzCast: Byzantine-Resilient Real-Time Reliable Broadcast

Today's cyber-physical systems face various impediments to achieving the...

Please sign up or login with your details

Forgot password? Click here to reset