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)
Practical Byzantine fault tolerance
OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
ACM Transactions on Computer Systems (TOCS)
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
Information and Computation
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Total Ordering Algorithms for Asynchronous Byzantine Systems
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
Optimal Unconditional Information Diffusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
The SecureRing Protocols for Securing Group Communication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Spreading rumors cheaply, quickly, and reliably
Spreading rumors cheaply, quickly, and reliably
Distributed Computing
Proceedings of the twenty-second annual symposium on Principles of distributed computing
IEEE Transactions on Dependable and Secure Computing
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Resilient software mirroring with untrusted third parties
Proceedings of the 1st International Workshop on Hot Topics in Software Upgrades
Write Markers for Probabilistic Quorum Systems
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
ACM Transactions on Algorithms (TALG)
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Preventing DDoS attacks on internet servers exploiting P2P systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Discovering network topology in the presence of byzantine faults
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Probabilistic opaque quorum systems
DISC'07 Proceedings of the 21st international conference on Distributed Computing
On byzantine broadcast in loosely connected networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 5.23 |
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 this, each correct replica further propagates an update only after receiving it from at least t others. In this way, no correct replica will ever propagate or accept an update that only faulty replicas introduce, since it will receive that update from only the t - 1 faulty replicas.We provide the first analysis of diffusion 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 measures that characterize the efficiency of diffusion algorithms, delay and fan-in, and prove general lower bounds with regards to these measures. We then provide a family of diffusion algorithms that have nearly optimal delay/fan-in product.