Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions

DOI10.1007/978-3-030-64375-1_15MaRDI QIDQ2055729zbMATH OpenOpenAlexFDO

Authors Jun Wan, Hanshen Xiao, Srinivas Devadas, Elaine Shi

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)

Recommendations

• Asynchronous Byzantine reliable broadcast with a message adversary
• On the versatility of Bracha's Byzantine reliable broadcast algorithm
• Round-optimal Byzantine agreement
• Boosting the Efficiency of Byzantine-Tolerant Reliable Communication
• Expected constant round Byzantine broadcast under dishonest majority
• On Byzantine broadcast in loosely connected networks
• Broadcast using certified propagation algorithm in presence of Byzantine faults
• A new parameter for a broadcast algorithm with locally bounded Byzantine faults

Cited in

(19)

• Adaptive security, erasures, and network assumptions in communication-local MPC
• Early stopping Byzantine agreement in (1+ ) f rounds
• All Byzantine agreement problems are expensive
• Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
• Communication lower bounds for cryptographic broadcast protocols
• Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
• Expected constant round Byzantine broadcast under dishonest majority
• Completeness theorems for adaptively secure broadcast
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
• Transparent batchable time-lock puzzles and applications to Byzantine consensus
• Nearly optimal parallel broadcast in the plain public key model
• Round-optimal Byzantine agreement
• Time-lock puzzles with efficient batch solving
• Early stopping for any number of corruptions
• Asymptotically optimal early termination for dishonest majority broadcast
• Time-lock puzzles from lattices
• Round efficient Byzantine agreement from VDFs
• Expected constant round Byzantine broadcast under dishonest majority
• How Byzantine is a send corruption?

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2055729)