REVIEW 2 cited by
OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
COOL (Chen'21) is an error-free and deterministic Byzantine agreement protocol that achieves consensus on an $\ell$-bit message with a communication complexity of $O(\max\{n\ell, n t \log t \})$ bits in four phases, given $n\geq 3t + 1$, for a network of $n$ nodes, where up to $t$ nodes may be dishonest. In this work we show that COOL can be optimized by reducing one communication round. The new protocol is called OciorCOOL. Additionally, building on OciorCOOL, we design an optimal reliable broadcast protocol that requires only six communication rounds.
Forward citations
Cited by 2 Pith papers
-
Extending Asynchronous Byzantine Agreement with Crusader Agreement
A new reduction plus two new crusader agreement protocols aims to give asynchronous byzantine agreement on long messages quadratic-in-n communication with information-theoretic security.
-
Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security
Ocior is a leaderless asynchronous BFT protocol advertising two-round finality and O(n) overhead via a layered threshold signature, but its adaptive-security proofs are deferred and its O(n) computation good case is v...
Discussion (0). Continue with ORCID to comment.