Asynchronous Byzantine agreement with subquadratic communication

DOI10.1007/978-3-030-64375-1_13OpenAlexW3046310492MaRDI QIDQ2055727

Chen-Da Liu-Zhang, Julian Loss, Erica Blum, Jonathan N. Katz

Publication date: 1 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-64375-1_13

Mathematics Subject Classification ID

Cryptography (94A60) Computer system organization (68Mxx)

Related Items (10)

YOSO: You only speak once. Secure MPC with stateless ephemeral roles ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Gossiping for communication-efficient broadcast ⋮ Expected linear round synchronization: the missing link for linear Byzantine SMR ⋮ Efficient adaptively-secure Byzantine agreement for long messages ⋮ Completeness theorems for adaptively secure broadcast ⋮ Perfect MPC over layered graphs ⋮ Communication complexity of Byzantine agreement, revisited ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ Random-index PIR and applications

This page was built for publication: Asynchronous Byzantine agreement with subquadratic communication