Research About Server Concealing Based On Structured P2P

The Internet, while developing rapidly, is facing huge security threats whenserving to more and more people. Servers have been the major target of attackingbecause the attacking on servers will have greater destructive influence than onindividuals. On the other hand, the information published on server which may offendthe powerful thus was forced to be deleted and the identity of the publisher may beforcedly revealed. For the above reasons, the study of how to help servers concealthemselves to avoiding attacking, censorship, threatening, thus protect the informationand the source of the information has important practical significance.This paper first reviews the existing anonymous communication technology,analyzes P2P based anonymous communication algorithm, pointing out ways ofattacking on anonymous communication and the measurement about the degree ofanonymity. We find out from the above study that, the existing anonymouscommunication puts more consideration on communication relationship anonymity,but fails to fully consider the server security. Server is still facing attacks, censorshipand threat of closing.Then, this paper presents a module named DSPBSC which can conceal the serverbased on structured P2P network. DSPBSC make servers disguised as common P2Pnodes and providing a high level of anonymity at the same time. We give detaileddesign of the topology maintenance (nodes join, leave, age), information maintenance(publish, update, delete) for DSPBSC to meet the request of scalability, anonymity,fault-tolerance and so on. To optimize the broadcast behavior on structured P2P, wepropose S-Gossip algorithm which combines the advantage of Gossip and flooding.S-Gossip can provide much higher dissemination speed, higher coverage whilegreatly decrease the duplicated messages. Because the current random forwarding rerouting protocol use the decrease forwarding probability which causes the loss ofanonymity, we introduced a new decrease forwarding probability algorithm. We alsointroduced server switch mechanism to address the problem of long time attacking.In the end we simulate the algorithm to study the main factors influence payload,efficiency and anonymity of the system. Tests results show that S-Gossip can achievehigh speed and high coverage with low message redundancy. DSPBSC can thusprovide high efficiency and anonymity.