STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Asynchronous secure computation
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Asynchronous secure computations with optimal resilience (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Practical loss-resilient codes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Censorship resistant peer-to-peer content addressable networks
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
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
Efficient Asynchronous Secure Multiparty Distributed Computation
INDOCRYPT '00 Proceedings of the First International Conference on Progress in Cryptology
Asynchronous Unconditionally Secure Computation: An Efficiency Improvement
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
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
SkipNet: a scalable overlay network with practical locality properties
USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Robust distributed name service
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
WormShield: Fast Worm Signature Generation with Distributed Fingerprint Aggregation
IEEE Transactions on Dependable and Secure Computing
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
Scalable Byzantine Fault Tolerant Public Key Authentication for Peer-to-Peer Networks
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Robust random number generation for peer-to-peer systems
Theoretical Computer Science
Scalable onion routing with torsk
Proceedings of the 16th ACM conference on Computer and communications security
Brief Announcement: Induced Churn to Face Adversarial Behavior in Peer-to-Peer Systems
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Availability for DHT-based overlay networks with unidirectional routing
WISTP'08 Proceedings of the 2nd IFIP WG 11.2 international conference on Information security theory and practices: smart devices, convergence and next generation networks
Veracity: practical secure network coordinates via vote-based agreements
USENIX'09 Proceedings of the 2009 conference on USENIX Annual technical conference
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
Secure routing strategies in DHT-based systems
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
A comparative study of rateless codes for P2P persistent torage
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Uniform and ergodic sampling in unstructured peer-to-peer systems with malicious nodes
OPODIS'10 Proceedings of the 14th international conference on Principles 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
SybilLimit: a near-optimal social network defense against sybil attacks
IEEE/ACM Transactions on Networking (TON)
CR-Chord: Improving lookup availability in the presence of malicious DHT nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
Robust random number generation for peer-to-peer systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Commensal cuckoo: secure group partitioning for large-scale services
ACM SIGOPS Operating Systems Review
Performance evaluation of large-scale dynamic systems
ACM SIGMETRICS Performance Evaluation Review
Adding query privacy to robust DHTs
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Towards practical communication in Byzantine-resistant DHTs
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Chord is a distributed hash table (DHT) that requires only O(log n) links per node and performs searches with latency and message cost O(log n), where n is the number of peers in the network. Chord assumes all nodes behave according to protocol. We give a variant of Chord which is robust with high probability for any time period during which: 1) there are always at least z total peers in the network for some integer z; 2) there are never more than (1/4–ε)z Byzantine peers in the network for a fixed ε 0; and 3) the number of peer insertion and deletion events is no more than zk for some tunable parameter k. We assume there is an adversary controlling the Byzantine peers and that the IP-addresses of all the Byzantine peers and the locations where they join the network are carefully selected by this adversary. Our notion of robustness is rather strong in that we not only guarantee that searches can be performed but also that we can enforce any set of “proper behavior” such as contributing new material, etc. In comparison to Chord, the resources required by this new variant are only a polylogarithmic factor greater in communication, messaging, and linking costs.