Name
Abstract | ||
|---|---|---|
In this paper we consider the problem of targeted attacks in large scale peer-to-peer overlays. These attacks aimed at exhausting key resources of targeted hosts to diminish their capacity to provide or receive services. To defend the system against such attacks, we rely on clustering and implement induced churn to preserve randomness of nodes identifiers so that adversarial predictions are impossible. We propose robust join, leave, merge and split operations to discourage brute force denial of services and pollution attacks. We show that combining a small amount of randomization in the operations, and adequately tuning the sojourn time of peers in the same region of the overlay allows first to decrease the effect of targeted attacks at cluster level, and second to prevent pollution propagation in the whole overlay. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/DSN.2011.5958248 | DSN |
Keywords | Field | DocType |
computer network security,peer-to-peer computing,denial-of-service attack,join operation,large scale dynamic systems,leave operation,merge operation,peer-to-peer nodes identifier,peer-to-peer overlays,pollution attack,split operation,targeted attack evaluation,targeted attack modeling,Adversary,Churn,Clusterized P2P Overlays,Collusion,Markov chains | Identifier,Computer security,Computer science,Network security,Markov chain,Computer network,Adversary,Cluster analysis,Overlay,Randomness,Distributed computing,Collusion | Conference |
ISSN | Citations | PageRank |
1530-0889 | 3 | 0.40 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Emmanuelle Anceaume | 1 | 211 | 29.98 |
| Bruno Sericola | 2 | 258 | 29.41 |
| Romaric Ludinard | 3 | 19 | 6.51 |
| Frederic Tronel | 4 | 137 | 12.63 |