How to spread adversarial nodes?: rotate!
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
TrustGuard: countering vulnerabilities in reputation management for decentralized overlay networks
WWW '05 Proceedings of the 14th international conference on World Wide Web
A Novel Methodology for Constructing Secure Multipath Overlays
IEEE Internet Computing
Towards a scalable and robust DHT
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Securing decentralized reputation management using TrustGuard
Journal of Parallel and Distributed Computing - Special issue: Security in grid and distributed systems
Countering targeted file attacks using locationguard
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
Flexible security in peer-to-peer applications: Enabling new opportunities beyond file sharing
Computer Networks: The International Journal of Computer and Telecommunications Networking
P2P systems with transactional semantics
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
The Exclusion of Malicious Routing Peers in Structured P2P Systems
Agents and Peer-to-Peer Computing
Quantifying Resistance to the Sybil Attack
Financial Cryptography and Data Security
Robust random number generation for peer-to-peer systems
Theoretical Computer Science
Reputation management algorithms for DHT-based peer-to-peer environment
Computer Communications
PeerTIS: a peer-to-peer traffic information system
Proceedings of the sixth ACM international workshop on VehiculAr InterNETworking
Researches on secure proximity distance defending attack of finger table based on chord
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
Informant: detecting sybils using incentives
FC'07/USEC'07 Proceedings of the 11th International Conference on Financial cryptography and 1st International conference on Usable Security
Availability for DHT-based overlay networks with unidirectional routing
WISTP'08 Proceedings of the 2nd IFIP WG 11.2 international conference on Information security theory and practices: smart devices, convergence and next generation networks
Evaluating peer-to-peer for loosely coupled business collaboration: a case study
BPM'07 Proceedings of the 5th international conference on Business process management
Accountable file indexing against DDoS attacks in peer-to-peer networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A survey of DHT security techniques
ACM Computing Surveys (CSUR)
Secure routing strategies in DHT-based systems
Globe'10 Proceedings of the Third international conference on Data management in grid and peer-to-peer systems
CR-Chord: Improving lookup availability in the presence of malicious DHT nodes
Computer Networks: The International Journal of Computer and Telecommunications Networking
EventGuard: A System Architecture for Securing Publish-Subscribe Networks
ACM Transactions on Computer Systems (TOCS)
Robust random number generation for peer-to-peer systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Chord-PKI: A distributed trust infrastructure based on P2P networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
Commensal cuckoo: secure group partitioning for large-scale services
ACM SIGOPS Operating Systems Review
Performance evaluation of large-scale dynamic systems
ACM SIGMETRICS Performance Evaluation Review
Hi-index | 0.00 |
A number of recent applications have been built on distributed hash tables (DHTs) based overlay networks. Almost all DHT-based schemes employ a tight deterministic data placement and ID mapping schemes. This feature 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 attacks 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 explores the routing anomalies that can be caused by malicious nodes returning incorrect lookup routes. The second 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 quantitative analysis to estimate the extent of damage that can be caused by the attack; followed by experimental validation and defenses to guard the overlay networks from such attacks.