2024/09/09 by Jinyuan Chen, Chen, Jinyuan
Computer Science · #Cryptography and Security (cs.CR) #Data Structures and Algorithms (cs.DS) #Distributed #FOS: Computer and information sciences #Information Theory (cs.IT) #Mobile Agent-Based Network Management #Parallel #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2409.06008
openalex publication_date 2024/09/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
COOL (Chen'21) is an error-free and deterministic Byzantine agreement protocol that achieves consensus on an ℓ-bit message with a communication complexity of O(max\nℓ, n t log t \) bits in four phases, given n≥ 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.