Open AccessJournal Article
Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected O(n 2) Communication, and Optimal Resilience.
Reads0
Chats0
TLDR
New protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of f faults among \(n=2f+1\) parties are presented, achieving an expected O(1) round complexity and an expected \(O(n^2)\) communication complexity.Abstract:
We present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of f faults among \(n=2f+1\) parties. Our protocols achieve an expected O(1) round complexity and an expected \(O(n^2)\) communication complexity. The exact round complexity in expectation is 10 for a static adversary and 16 for a strongly rushing adaptive adversary. For comparison, previous protocols in the same setting require expected 29 rounds.read more
Citations
More filters
Proceedings ArticleDOI
Asymptotically Optimal Validated Asynchronous Byzantine Agreement
TL;DR: A new protocol for Validated Asynchronous Byzantine Agreement in the authenticated setting with optimal resilience of ƒ < n/3 Byzantine failures and asymptotically optimal expected O(1) running time to reach agreement.
Proceedings ArticleDOI
Dumbo: Faster Asynchronous BFT Protocols
TL;DR: In this paper, two new atomic broadcast protocols (called Dumbo1, Dumbo2) were proposed, which have asymptotically and practically better efficiency than HoneyBadgerBFT.
Proceedings ArticleDOI
Sync HotStuff: Simple and Practical Synchronous State Machine Replication
TL;DR: This work presents Sync HotStuff, a surprisingly simple and intuitive synchronous BFT solution that achieves consensus with a latency of 2Δ in the steady state (where Δ is a synchronous message delay upper bound), which is comparable to the best known partially synchronous solution.
Posted Content
Communication Complexity of Byzantine Agreement, Revisited
TL;DR: In this paper, the authors show that disallowing after-the-fact removal is necessary for achieving subquadratic-communication Byzantine agreement (BA) protocols with near-optimal resilience and expected constant rounds under standard cryptographic assumptions and a public-key infrastructure.
Book ChapterDOI
Synchronous Byzantine Agreement with Expected O(1) Rounds, Expected \(O(n^2)\) Communication, and Optimal Resilience
TL;DR: In this article, the authors present new protocols for Byzantine agreement in the synchronous and authenticated setting, tolerating the optimal number of f faults among n = 2f+1 parties.
References
More filters
Book ChapterDOI
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Proceedings ArticleDOI
Practical Byzantine fault tolerance
Miguel Castro,Barbara Liskov +1 more
TL;DR: A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.
Journal ArticleDOI
OceanStore: an architecture for global-scale persistent storage
John Kubiatowicz,David Bindel,Yan Chen,Steven E. Czerwinski,Patrick Eaton,Dennis Geels,Ramakrishna Gummadi,Sean Rhea,Hakim Weatherspoon,Westley Weimer,Chris Wells,Ben Y. Zhao +11 more
TL;DR: OceanStore monitoring of usage patterns allows adaptation to regional outages and denial of service attacks; monitoring also enhances performance through pro-active movement of data.
Journal ArticleDOI
The part-time parliament
TL;DR: The Paxon parliament's protocol provides a new way of implementing the state machine approach to the design of distributed systems.
Journal ArticleDOI
Reaching Agreement in the Presence of Faults
TL;DR: It is shown that the problem is solvable for, and only for, n ≥ 3m + 1, where m is the number of faulty processors and n is the total number and this weaker assumption can be approximated in practice using cryptographic methods.