Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
Protecting web servers from distributed denial of service attacks
Proceedings of the 10th international conference on World Wide Web
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Internet indirection infrastructure
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A Lightweight, Robust P2P System to Handle Flash Crowds
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Peer-to-Peer Caching Schemes to Address Flash Crowds
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
The Case for Cooperative Networking
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Using graphic turing tests to counter automated DDoS attacks against web servers
Proceedings of the 10th ACM conference on Computer and communications security
A taxonomy of DDoS attack and DDoS defense mechanisms
ACM SIGCOMM Computer Communication Review
Pagoda: a dynamic overlay network for routing, data management, and multicasting
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Internet Denial of Service: Attack and Defense Mechanisms (Radia Perlman Computer Networking and Security)
A DoS-limiting network architecture
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A Framework for a Collaborative DDoS Defense
ACSAC '06 Proceedings of the 22nd Annual Computer Security Applications Conference
Botz-4-sale: surviving organized DDoS attacks that mimic flash crowds
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
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
Novel architectures for P2P applications: The continuous-discrete approach
ACM Transactions on Algorithms (TALG)
A denial-of-service resistant DHT
DISC'07 Proceedings of the 21st international conference on Distributed Computing
Robust architectures for open distributed systems and topological self-stabilization: invited paper
Proceedings of the Third International Workshop on Reliability, Availability, and Security
IRIS: a robust information system against insider dos-attacks
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely connected servers) called Chameleon which is robust to DoS attacks on the nodes as well as the operations of the system. In particular, it allows nodes to efficiently look up and insert data items at any time, despite a powerful "past-insider adversary" which has complete knowledge of the system up to some time point t0 and can use that knowledge in order to block a constant fraction of the nodes and inject lookup and insert requests to selected data. This is achieved with a smart randomized replication policy requiring a polylogarithmic overhead only and the interplay of a permanent and a temporary distributed hash table. All requests in Chameleon can be processed in polylogarithmic time and work at every node.