DMCA
Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis
Cached
Download Links
- [www.acsa-admin.org]
- [www.acsac.org]
- [www.acsac.org]
- DBLP
Other Repositories/Bibliography
| Venue: | in 20th Annual Computer Security Applications Conference (ACSAC '04). 2004 |
| Citations: | 35 - 1 self |
BibTeX
@INPROCEEDINGS{Srivatsa_vulnerabilitiesand,
author = {Mudhakar Srivatsa and Ling Liu},
title = {Vulnerabilities and Security Threats in Structured Overlay Networks: A Quantitative Analysis},
booktitle = {in 20th Annual Computer Security Applications Conference (ACSAC '04). 2004},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract 1 A number of recent applications have been built on distributed hash tables (DHTs) based overlay networks. Almost all DHT-based schemes employ a tight determin-istic data placement and ID mapping schemes. This fea-ture on one hand provides assurance on location of data if it exists, within a bounded number of hops, and on the other hand, opens doors for malicious nodes to lodge at-tacks that can potentially thwart the functionality of the overlay network. This paper studies several serious security threats in DHT-based systems through two targeted attacks at the overlay network’s protocol layer. The first attack ex-plores the routing anomalies that can be caused by mali-cious nodes returning incorrect lookup routes. The sec-ond attack targets the ID mapping scheme. We disclose that the malicious nodes can target any specific data item in the system; and corrupt/modify the data item to its favor. For each of these attacks, we provide quanti-tative analysis to estimate the extent of damage that can be caused by the attack; followed by experimental vali-dation and defenses to guard the overlay networks from such attacks. 1
Keyphrases
structured overlay network quantitative analysis security threat overlay network malicious node id mapping scheme sec-ond attack first attack targeted attack dht-based system recent application distributed hash table dht-based scheme quanti-tative analysis specific data item mali-cious node tight determin-istic data placement experimental vali-dation bounded number routing anomaly incorrect lookup route data item overlay network protocol layer
