Distributed Hash Tables in P2P Network: Detection and Prevention of Threats and Vulnerability

Abstract

Currently the peer-to-peer search focuses on efficient hash lookup systems which can be use in building more complex distributed systems. These system works well when their algorithms are executed in right direction but generally they don’t consider how to handle misbehaving nodes. In our paper we considers different sorts of security problems which are inherent in peer-to peer systems based on distributed hash lookup systems. We examine different types of problems that this kind of systems might face, taking examples from existing systems. Here we propose some design principles for detecting as well preventing those problems.

Keywords- Distributed hash lookup systems, verifiable system invariants, verifiable key assignment, Server selection in routing.