Work

Communication-Optimal Convex Agreement

Year: 2025

Type: conference-paper

Abstract: Byzantine Agreement (BA) allows a set of n parties to agree on a value even when up to t of the parties involved are corrupted. While previous works have shown that, for ℓ-bit inputs, BA can be achieved with the optimal communication complexity O(ℓn) for sufficiently large ℓ, BA only ensures that honest parties agree on a meaningful output when they hold the same input, rendering the primitive inadequate for many real-world applications.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/3732772.3733551

Authors: Diana Ghinea, Chen-Da Liu-Zhang, Roger Wattenhofer

Institutions: Lucerne University of Applied Sciences and Arts, ETH Zurich

Language: English

Topic: Distributed systems and fault tolerance

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4411275203

FWCI: 1.299

Cites: 41

Cited by: 1

Related to: 10