论文部分内容阅读
Sybil攻击通过恶意伪造大量虚假身份,破坏对等网络(P2P)网络中正常节点的寻路过程,是分布式Hash表网络(distributed Hash table,DHT)中主要的安全威胁。该文利用社交网络中社交关系的高可信度以及伪造难度大等特点,设计了Social-DHT方法以缓解DHT网络中Sybil攻击的影响。该方法采用基于社交关系的随机游走策略以构建相对可信的路由表,继而可以有效抵御Sybil恶意节点的影响,实现安全、高效的寻路过程。此外对该方法建立模型,对路由表的可信性和寻路阶段的成功概率进行了理论分析。仿真实验表明:在有10 000条攻击边的情况下节点路由表中Sybil节点比例不超过3%,搜索成功率则能够达到99%,并且在搜索速度和带宽开销等方面优于已有的算法。
Sybil attack is a major security threat in the distributed Hash table (DHT) by maliciously forging a large number of fake identities and destroying the path of the normal nodes in a peer-to-peer (P2P) network. In this paper, Social-DHT is designed to mitigate the impact of Sybil attacks on DHT networks by utilizing the high credibility of social relationships and the difficulty of counterfeiting. This method uses a random walk strategy based on social relations to build a relatively reliable routing table, which can effectively resist the influence of Sybil malicious nodes to achieve a safe and efficient path-finding process. In addition, a model of this method is established, and the credibility of the routing table and the probability of success in the path-finding stage are analyzed theoretically. The simulation results show that the Sybil nodes in the routing table do not exceed 3% and the search success rate can reach 99% with 10 000 attack edges, and are superior to the existing algorithms in terms of search speed and bandwidth overhead .