Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions

DOI10.1007/978-3-030-64375-1_15OpenAlexW3096365915MaRDI QIDQ2055729

Elaine Shi, Srinivas Devadas, Hanshen Xiao, Jun Wan

Publication date: 1 December 2021

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

Mathematics Subject Classification ID

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

Related Items (5)

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 ⋮ Completeness theorems for adaptively secure broadcast ⋮ How Byzantine is a send corruption?

This page was built for publication: Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions