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

DOI10.1016/S0304-3975(02)00325-0zbMATH Open1038.68006MaRDI QIDQ1874396FDOQ1874396

Yishay Mansour, Michael K. Reiter, Dahlia Malkhi

Publication date: 25 May 2003

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

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

zbMATH Keywords

Byzantine failuresdiffusion protocols

Mathematics Subject Classification ID

Network protocols (68M12)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Spreading a Rumor
• Authenticated Algorithms for Byzantine Agreement
• The Byzantine Generals Problem
• Asynchronous consensus and broadcast protocols
• Atomic broadcast: From simple message diffusion to Byzantine agreement
• Probabilistic quorum systems
• Byzantine-resistant total ordering algorithms.
• Title not available (Why is that?)

Cited In (4)

• Disseminating security updates at internet scale
• On the propagation of updates in distributed replicated systems
• Title not available (Why is that?)
• Confidential gossip

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)