Diffusion without false rumors: On propagating updates in a Byzantine environment.

DOI10.1016/S0304-3975(02)00325-0MaRDI QIDQ1874396zbMATHFDO

Authors Dahlia Malkhi, Yishay Mansour, Michael K. Reiter

Publication date 25 May 2003

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Byzantine failuresdiffusion protocols

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• scientific article; zbMATH DE number 2006644
• FAST BROADCASTING WITH BYZANTINE FAULTS
• Tolerating malicious gossip
• Bounds on information exchange for Byzantine agreement
• Authenticated Algorithms for Byzantine Agreement

Cites work

• scientific article; zbMATH DE number 2006644 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Asynchronous consensus and broadcast protocols
• Atomic broadcast: From simple message diffusion to Byzantine agreement
• Authenticated Algorithms for Byzantine Agreement
• Byzantine quorum systems
• Byzantine-resistant total ordering algorithms.
• On Spreading a Rumor
• Probabilistic quorum systems
• Probability Inequalities for Sums of Bounded Random Variables
• The Byzantine Generals Problem

Cited in

(5)

• Tolerating malicious gossip
• On the propagation of updates in distributed replicated systems
• Confidential gossip
• Disseminating security updates at internet scale
• scientific article; zbMATH DE number 2006644 (Why is no real title available?)

This page was built for publication: Diffusion without false rumors: On propagating updates in a Byzantine environment.

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