SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Secure agreement protocols: reliable and atomic group multicast in rampart
CCS '94 Proceedings of the 2nd ACM Conference on Computer and communications security
An introduction to computational learning theory
An introduction to computational learning theory
Atomic broadcast: from simple message diffusion to Byzantine agreement
Information and Computation
Randomized algorithms
Asynchronous consensus and broadcast protocols
Journal of the ACM (JACM)
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A high-throughput secure reliable multicast protocol
Journal of Computer Security
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Grapevine: an exercise in distributed computing
Communications of the ACM
Total Ordering Algorithms for Asynchronous Byzantine Systems
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
The SecureRing Protocols for Securing Group Communication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Secure and Scalable Replication in Phalanx
SRDS '98 Proceedings of the The 17th IEEE Symposium on Reliable Distributed Systems
Bimodal Multicast
Distributed Computing
Drinking from the firehose: multicast USENET news
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
Information and Computation
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Optimal Unconditional Information Diffusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
A Secure and Highly Available Distributed Store for Meeting Diverse Data Storage Needs
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
Diffusion without false rumors: on propagating updates in a Byzantine environment
Theoretical Computer Science
Responsive Security for Stored Data
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Backoff Protocols for Distributed Mutual Exclusion and Ordering
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Deno: A Decentralized, Peer-to-Peer Object-Replication System for Weakly Connected Environments
IEEE Transactions on Computers
Distributed Computing
Securing publish-subscribe overlay services with EventGuard
Proceedings of the 12th ACM conference on Computer and communications security
ACM Transactions on Information and System Security (TISSEC)
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
How robust are gossip-based communication protocols?
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
On spreading recommendations via social gossip
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
Self-stabilizing and Byzantine-tolerant overlay network
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
On the runtime and robustness of randomized broadcasting
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer than t replicas fail, and that each update is initially received by at least t correct replicas. The goal is to diffuse each update to all correct replicas while ensuring that correct replicas accept no updates generated spuriously by faulty replicas. To achieve reliable diffusion, each correct replica accepts an update only after receiving it from at least t others.We provide the first analysis of epidemic-style protocols for such environments. This analysis is fundamentally different from known analyses for the benign case due to our treatment of fully Byzantine failures-which, among other things, precludes the use of digital signatures for authenticating forwarded updates. We propose two epidemic-style diffusion algorithms and two measures that characterize the efficiency of diffusion algorithms in general. We characterize both of our algorithms according to these measures, and also prove lower bounds with regards to these measures that show that our algorithms are close to optimal.