On the complexity of broadcast setup

DOI10.1007/978-3-642-39206-1_47MaRDI QIDQ5326591zbMATH OpenOpenAlexFDO

Authors Martin Hirt, Pavel Raykov

Publication date 6 August 2013

Published in Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-39206-1_47

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Information-theoretic broadcast with dishonest majority for long messages
• Multi-valued Byzantine broadcast: the \(t < n\) case
• The broadcast message complexity of secure multiparty computation
• Adaptively secure broadcast
• Broadcast from minicast secure against general adversaries

Cited in

(4)

• The complexity of finding a broadcast center
• Multi-valued Byzantine broadcast: the \(t < n\) case
• Broadcast (and round) efficient verifiable secret sharing
• Gossiping for communication-efficient broadcast

This page was built for publication: On the complexity of broadcast setup

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