Partitioned encryption and achieving simultaneity by partitioning
Information Processing Letters
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
How to spread adversarial nodes?: rotate!
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The expansion and mixing time of skip graphs with applications
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Towards a Scalable and Robust DHT
Theory of Computing Systems - Special Issue: Symposium on Parallelism in Algorithms and Architectures 2006; Guest Editors: Robert Kleinberg and Christian Scheideler
A Distributed and Oblivious Heap
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Parsimonious flooding in dynamic graphs
Proceedings of the 28th ACM symposium on Principles of distributed computing
Distributed computation in dynamic networks
Proceedings of the forty-second ACM symposium on Theory of computing
Scalable byzantine computation
ACM SIGACT News
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Load balanced scalable Byzantine agreement through quorum building, with full information
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Estimating sizes of social networks via biased sampling
Proceedings of the 20th international conference on World wide web
Coordinated consensus in dynamic networks
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Adaptively secure broadcast, revisited
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Xheal: localized self-healing using expanders
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
An algorithm for implementing BFT registers in distributed systems with bounded churn
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Regular register: an implementation in a churn prone environment
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Tapestry: a resilient global-scale overlay for service deployment
IEEE Journal on Selected Areas in Communications
Scalable and Secure Polling in Dynamic Distributed Networks
SRDS '12 Proceedings of the 2012 IEEE 31st Symposium on Reliable Distributed Systems
Highly dynamic distributed computing with byzantine failures
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Highly dynamic distributed computing with byzantine failures
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Hi-index | 0.00 |
This paper shows for the first time that distributed computing can be both reliable and efficient in an environment that is both highly dynamic and hostile. More specifically, we show how to maintain clusters of size O(log N), each containing more than two thirds of honest nodes with high probability, within a system whose size can vary polynomially with respect to its initial size. Furthermore, the communication cost induced by each node arrival or departure is polylogarithmic with respect to N, the maximal size of the system. Our clustering can be achieved despite the presence of a Byzantine adversary controlling a fraction τ ≤ 1⁄3-ε of the nodes, for some fixed constant ε 0, independent of N. So far, such a clustering could only be performed for systems whose size can vary constantly and it was not clear whether that was at all possible for polynomial variances.