Confidential gossip

DOI10.1007/S00446-019-00367-XzbMath1460.68017OpenAlexW4233148032MaRDI QIDQ2204776

Chryssis Georgiou, Dariusz R. Kowalski

Publication date: 16 October 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-019-00367-x

zbMATH Keywords

confidentialityfault-tolerancecollusionrandomized gossipdynamic rumor injectionmessage complexity

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Uses Software

• Iolus

Cites Work

• Unnamed Item
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Diffusion without false rumors: On propagating updates in a Byzantine environment.
• How to share a secret
• On the Communication Surplus Incurred by Faulty Processors
• Time and Communication Efficient Consensus for Crash Failures
• Corrupting One vs. Corrupting Many: The Case of Broadcast and Multicast Encryption
• Tackling Adaptive Corruptions in Multicast Encryption Protocols
• Distributed Private Data Analysis: Simultaneously Solving How and What
• Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
• Foundations of Cryptography
• Tolerating malicious gossip
• Delegation of computation with verification outsourcing
• Meeting the deadline
• Asynchronous gossip
• Constructing scalable overlays for pub-sub with many topics
• Spatial gossip and resource location protocols
• Privacy-Preserving Set Operations
• Privacy-Preserving Graph Algorithms in the Semi-honest Model
• Fault-tolerant broadcasting and gossiping in communication networks
• Space-Time Coding
• Privacy preserving data mining

This page was built for publication: Confidential gossip