Tolerating malicious gossip

DOI10.1007/S00446-002-0082-4MaRDI QIDQ5138483zbMATH OpenOpenAlexFDO

Authors Yaron M. Minsky, Fred B. Schneider

Publication date 4 December 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00446-002-0082-4

zbMATH Keywords

Byzantine fault-tolerancegossip protocolsreplicated data

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• Dynamic gossip
• Secure peer sampling
• Diffusion without false rumors: On propagating updates in a Byzantine environment.
• An online distributed gossiping protocol for mobile networks
• scientific article; zbMATH DE number 1696679

Cited in

(5)

• Diffusion without false rumors: On propagating updates in a Byzantine environment.
• Confidential gossip
• Secure gossip against intermittently malicious agents
• Practical provably secure flooding for blockchains
• Secure peer sampling

This page was built for publication: Tolerating malicious gossip

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