From partial consistency to global broadcast

DOI10.1145/335305.335363zbMath1296.68013OpenAlexW2119841661MaRDI QIDQ3192019

Matthias Fitzi, Ueli M. Maurer

Publication date: 26 September 2014

Published in: Proceedings of the thirty-second annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/335305.335363

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12)

Related Items (8)

Broadcast from Minicast Secure Against General Adversaries ⋮ Authenticated broadcast with a partially compromised public-key infrastructure ⋮ Complete characterization of broadcast and pseudo-signatures from correlations ⋮ Consensus in the presence of mortal Byzantine faulty processes ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ On expected constant-round protocols for Byzantine agreement ⋮ Strong Separations Between Broadcast and Authenticated Channels ⋮ Authenticated Byzantine Generals in Dual Failure Model

This page was built for publication: From partial consistency to global broadcast