Strong Separations Between Broadcast and Authenticated Channels

DOI10.4230/LIPICS.DISC.2018.36zbMath1497.68047OpenAlexW2898905608MaRDI QIDQ5090929

Julian Loss, Ueli M. Maurer, Daniel Tschudi

Publication date: 21 July 2022

Full work available at URL: https://doi.org/10.4230/LIPIcs.DISC.2018.36

zbMATH Keywords

cryptographybroadcastimpossibilitymulti-party computation

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Distributed systems (68M14)

Cites Work

• Player simulation and general adversary structures in perfect multiparty computation
• Byzantine agreement given partial broadcast
• Efficient General-Adversary Multi-Party Computation
• On the price of equivocation in byzantine agreement
• From partial consistency to global broadcast
• Broadcast from Minicast Secure Against General Adversaries
• The Weak Byzantine Generals Problem
• The Byzantine Generals Problem
• Detectable byzantine agreement secure against faulty majorities
• Towards a Theory of Consistency Primitives
• On Byzantine Agreement over (2,3)-Uniform Hypergraphs
• Broadcast Amplification

This page was built for publication: Strong Separations Between Broadcast and Authenticated Channels