Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Implementing fault-tolerant services using the state machine approach: a tutorial
ACM Computing Surveys (CSUR)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
OceanStore: an architecture for global-scale persistent storage
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
The Rampart Toolkit for Building High-Integrity Services
Selected Papers from the International Workshop on Theory and Practice in Distributed Systems
The SecureRing Protocols for Securing Group Communication
HICSS '98 Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences - Volume 3
Separating agreement from execution for byzantine fault tolerant services
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
ACSAC '04 Proceedings of the 20th Annual Computer Security Applications Conference
Farsite: federated, available, and reliable storage for an incompletely trusted environment
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Secure routing for structured peer-to-peer overlay networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
How to spread adversarial nodes?: rotate!
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The design of a robust peer-to-peer system
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Salsa: a structured approach to large-scale anonymity
Proceedings of the 13th ACM conference on Computer and communications security
Robust services in dynamic systems
Robust services in dynamic systems
Fireflies: scalable support for intrusion-tolerant network overlays
Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Denial of service via algorithmic complexity attacks
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
Novel architectures for P2P applications: The continuous-discrete approach
ACM Transactions on Algorithms (TALG)
Zyzzyva: speculative byzantine fault tolerance
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Attested append-only memory: making adversaries stick to their word
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Large-scale byzantine fault tolerance: safe but not always live
HotDep'07 Proceedings of the 3rd workshop on on Hot Topics in System Dependability
Reducing communication costs in robust peer-to-peer networks
Information Processing Letters
Robust random number generation for peer-to-peer systems
Theoretical Computer Science
TrInc: small trusted hardware for large distributed systems
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Distributed Key Generation for the Internet
ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
ShadowWalker: peer-to-peer anonymous communication using redundant structured topologies
Proceedings of the 16th ACM conference on Computer and communications security
Practical threshold signatures
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Lower bounds for asynchronous consensus
Future directions in distributed computing
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Census: location-aware membership management for large-scale distributed systems
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Towards practical communication in Byzantine-resistant DHTs
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We present commensal cuckoo,* a secure group partitioning scheme for large-scale systems that maintains the correctness of many small groups, despite a Byzantine adversary that controls a constant (global) fraction of all nodes. In particular, the adversary is allowed to repeatedly rejoin faulty nodes to the system in an arbitrary adaptive manner, e.g., to collocate them in the same group. Commensal cuckoo addresses serious practical limitations of the state-ofthe- art scheme, the cuckoo rule of Awerbuch and Scheideler, tolerating 32x--41x more faulty nodes with groups as small as 64 nodes (as compared to the hundreds required by the cuckoo rule). Secure group partitioning is a key component of highly-scalable, reliable systems such as Byzantine faulttolerant distributed hash tables (DHTs).