Name
Abstract | ||
|---|---|---|
Several large scale P2P networks operating on the Internet are based on a Distributed Hash Table. These networks offer valuable services, but they all suffer from a critical issue allowing malicious nodes to be inserted in specific places on the DHT for undesirable purposes (monitoring, distributed denial of service, pollution, etc.). While several attacks and attack scenarios have been documented, few studies have measured the actual deployment of such attacks and none of the documented countermeasures have been tested for compatibility with an already deployed network. In this article, we focus on the KAD network. Based on large scale monitoring campaigns, we show that the world-wide deployed KAD network suffers large number of suspicious insertions around shared contents and we quantify them. To cope with these peers, we propose a new efficient protection algorithm based on analyzing the distribution of the peers’ ID found around an entry after a DHT lookup. We evaluate our solution and show that it detects the most efficient configurations of inserted peers with a very small false-negative rate, and that the countermeasures successfully filter almost all the suspicious peers. We demonstrate the direct applicability of our approach by implementing and testing our solution in real P2P networks. |
Year | DOI | Venue |
|---|---|---|
2013 | https://doi.org/10.1007/s12083-012-0137-7 | Peer-to-Peer Networking and Applications |
Keywords | DocType | Volume |
P2P networks,Distributed hash table,KAD,Monitoring,Security,Sybil attack,Attack detection,Defense | Journal | 6 |
Issue | ISSN | Citations |
2 | 1936-6442 | 8 |
PageRank | References | Authors |
0.56 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thibault Cholez | 1 | 100 | 11.89 |
| Isabelle Chrisment | 2 | 225 | 25.75 |
| Olivier Festor | 3 | 665 | 85.40 |
| Guillaume Doyen | 4 | 98 | 13.25 |