Expected constant round Byzantine broadcast under dishonest majority

DOI10.1007/978-3-030-64375-1_14OpenAlexW3031187036MaRDI QIDQ2055728

Hanshen Xiao, Srinivas Devadas, Elaine Shi, Jun Wan

Publication date: 1 December 2021

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

Mathematics Subject Classification ID

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

Related Items (7)

Round-optimal Byzantine agreement ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ Gossiping for communication-efficient broadcast ⋮ Completeness theorems for adaptively secure broadcast ⋮ On the Amortized Communication Complexity of Byzantine Broadcast ⋮ How Byzantine is a send corruption?

This page was built for publication: Expected constant round Byzantine broadcast under dishonest majority