Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
On the fault tolerance of the butterfly
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Randomized algorithms
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Probabilistic Byzantine quorum systems
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
On the Fault Tolerance of Some Popular Bounded-Degree Networks
SIAM Journal on Computing
The Load and Availability of Byzantine Quorum Systems
SIAM Journal on Computing
Communications of the ACM
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
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
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Peer-to-Peer: Harnessing the Power of Disruptive Technologies
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Fault tolerant data structures
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Viceroy: a scalable and dynamic emulation of the butterfly
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Analysis of the evolution of peer-to-peer systems
Proceedings of the twenty-first annual symposium on Principles of distributed computing
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Bounding Work and Communication in Robust Cooperative Computation
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Dynamically Fault-Tolerant Content Addressable Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Observations on the Dynamic Evolution of Peer-to-Peer Networks
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Butterflies and Peer-to-Peer Networks
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A case for associative peer to peer overlays
ACM SIGCOMM Computer Communication Review
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience
IEEE/ACM Transactions on Networking (TON)
Online scheduling of splittable tasks
ACM Transactions on Algorithms (TALG)
SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol
IEEE Transactions on Parallel and Distributed Systems
D2B: a de Bruijn based content-addressable network
Theoretical Computer Science - Complex networks
Survey of research towards robust peer-to-peer networks: search methods
Computer Networks: The International Journal of Computer and Telecommunications Networking
Associative search in peer to peer networks: Harnessing latent semantics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Novel architectures for P2P applications: The continuous-discrete approach
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
IEEE/ACM Transactions on Networking (TON)
Davis social links: integrating social networks with internet routing
Proceedings of the 2007 workshop on Large scale attack defense
Reducing communication costs in robust peer-to-peer networks
Information Processing Letters
A randomized algorithm for the joining protocol in dynamic distributed networks
Theoretical Computer Science
Efficient Content Authentication in Peer-to-Peer Networks
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Proceedings of the 4th international conference on Security and privacy in communication netowrks
Anonymity and Censorship Resistance in Unstructured Overlay Networks
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
On disconnection node failure and stochastic static resilience of P2P communication networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
Future directions in distributed computing
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
CollSec'10 Proceedings of the 2010 international conference on Collaborative methods for security and privacy
Robust architectures for open distributed systems and topological self-stabilization: invited paper
Proceedings of the Third International Workshop on Reliability, Availability, and Security
Towards robust and efficient computation in dynamic peer-to-peer networks
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Making chord robust to byzantine attacks
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Survive under high churn in structured P2P systems: evaluation and strategy
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
A self-repairing peer-to-peer system resilient to dynamic adversarial churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
Robust distributed name service
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Dependable peer-to-peer systems withstanding dynamic adversarial churn
Dependable Systems
Fast byzantine agreement in dynamic networks
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Storage and search in dynamic peer-to-peer networks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
We present a censorship resistant peer-to-peer Content Addressable Network for accessing n data items in a network of n nodes. Each search for a data item in the network takes O(log n) time and requires at most O(log2n) messages. Our network is censorship resistant in the sense that even after adversarial removal of an arbitrarily large constant fraction of the nodes in the network, all but an arbitrarily small fraction of the remaining nodes can obtain all but an arbitrarily small fraction of the original data items. The network can be created in a fully distributed fashion. It requires only O(log n) memory in each node. We also give a variant of our scheme that has the property that it is highly spam resistant: an adversary can take over complete control of a constant fraction of the nodes in the network and yet will still be unable to generate spam.