Gossiping for communication-efficient broadcast

DOI10.1007/978-3-031-15982-4_15zbMath1517.94014OpenAlexW3214310681MaRDI QIDQ6108990

Georgios Tsimos, Charalampos Papamanthou, Julian Loss

Publication date: 30 June 2023

Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-15982-4_15

zbMATH Keywords

Byzantine broadcastrandomized protocol for single-sender broadcast

Mathematics Subject Classification ID

Cryptography (94A60) Communication theory (94A05)

Related Items (3)

Practical provably secure flooding for blockchains ⋮ Completeness theorems for adaptively secure broadcast ⋮ Network-agnostic security comes (almost) for free in DKG and MPC

Cites Work

• Security and composition of multiparty cryptographic protocols
• Sublinear-round Byzantine agreement under corrupt majority
• Asynchronous Byzantine agreement with subquadratic communication
• Expected constant round Byzantine broadcast under dishonest majority
• Efficient constant-round MPC with identifiable abort and public verifiability
• Brahms
• Born and raised distributively
• Authenticated Algorithms for Byzantine Agreement
• Scalable leader election
• On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem
• Communication Complexity of Byzantine Agreement, Revisited
• Breaking the O ( n ² ) bit barrier
• Fully polynomial Byzantine agreement in t + 1 rounds
• Scalable Byzantine reliable broadcast

This page was built for publication: Gossiping for communication-efficient broadcast