TL;DR
DAG-Rider is a novel asynchronous Byzantine Atomic Broadcast protocol that combines optimal resilience, communication, and time complexity, ensuring all correct proposals are eventually decided in a post-quantum safe manner.
Contribution
It introduces DAG-Rider, the first protocol achieving optimal resilience, communication, and time complexity for asynchronous Byzantine Atomic Broadcast.
Findings
Achieves optimal resilience, communication, and time complexity.
Ensures eventual decision of all correct proposals.
Post-quantum safe protocol.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
