From partial consistency to global broadcast

DOI10.1145/335305.335363MaRDI QIDQ3192019zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Byzantine agreement given partial broadcast
• Broadcast from minicast secure against general adversaries
• Broadcast amplification
• scientific article; zbMATH DE number 2086726
• Adaptively secure broadcast

Cited in

(17)

• On expected constant-round protocols for Byzantine agreement
• Byzantine agreement given partial broadcast
• Authenticated broadcast with a partially compromised public-key infrastructure
• scientific article; zbMATH DE number 6381650 (Why is no real title available?)
• Authenticated Byzantine generals in dual failure model
• Broadcast from minicast secure against general adversaries
• Consensus in the presence of mortal Byzantine faulty processes
• scientific article; zbMATH DE number 2086726 (Why is no real title available?)
• Strong Separations Between Broadcast and Authenticated Channels
• Towards a Theory of Consistency Primitives
• Broadcast amplification
• Complete characterization of broadcast and pseudo-signatures from correlations
• Distributed CONGEST Algorithms against Mobile Adversaries
• From partial to global asynchronous reliable broadcast
• On broadcast in generalized network and adversarial models
• Early stopping Byzantine agreement in (1+ ) f rounds
• Efficient quantum detectable weak Byzantine agreement with optimal fault-tolerant bound

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

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