P2P文件共享系统安全性研究
摘要
做为本世纪初期互联网上发展最为迅猛的技术之一，P2P技术秉承了互联网发展初期的设计理念，摒弃了服务器与客户机之分，使得网络计算模式从集中向分布式偏移，充分利用了网络边缘的终端设备，使得网络中的所有成员都作为对等主体直接互联和交换文件，形成了规模更大，可扩展性更好的覆盖网络，许多基于P2P技术的应用也随之应运而生。然而，P2P技术在促进了Internet软硬件资源共享的同时，其固有的匿名性、动态性和开放性的特点也如同一把双刃剑，对互联网的安全性提出了更为严峻的挑战。由于服务的可靠性，所提供资源的真实性通常无法保证，又缺少中心组件的控制和管理，使得P2P网络中存在着更多可以被攻击者利用的漏洞。P2P网络的共享机制和快速选路机制，也为病毒和蠕虫提供了快速传播平台。这都严重制约了P2P系统的进一步推广，甚至威胁到了整个互联网的安全。如何提高P2P网络的安全性已经成为当前一项亟待解决的重要问题。本文的研究以P2P技术最初的应用模式文件共享系统为对象，从系统设计的角度分析了其安全性威胁及隐患，提出了若干提升P2P文件共享系统安全性的策略和方法。
全文首先系统地介绍了P2P网络的结构及其特点，总结了P2P网络的主要安全问题和研究现状。然后以典型的P2P文件共享系统的行为周期模型为脉络，分别研究了资源发布/搜索，节点选择，分块选择以及数据传输四个不同阶段下的主要安全威胁，并从系统设计的角度，针对性的提出了改进P2P网络安全性的方法。
首先，在数据传输阶段和分块选择阶段存在的假块污染攻击，属于典型的资源消耗攻击，严重的影响了P2P系统的可用性。本文以BitTorrent为研究对象，通过建立假块污染攻击的随机模型给出了攻击所能达到的理论上限。然后在半开放环境下进行了广域网实验，验证了假块污染攻击对实际应用的危害，得出污染攻击至少可以带来3倍以上的下载延迟。最后提出了对抗假块污染攻击的SmartHash算法，并从多个角度对其进行了优化，通过仿真实验的方式评价了该算法的有效性和可行性。
其次，在节点选择阶段的路由安全问题，不仅威胁到了系统的可用性，同时为其他更具破坏性的大规模网络攻击提供了实施平台。本文在实际网络环境下，针对BT的Mainline DHT进行了攻击验证，证明通过索引毒害和路由攻击的方式可以控制DHT的搜索结果。为了解决这一问题，本文提出了改进的节点ID生成机制、路由表更新机制以及搜索路径选择机制，通过理论分析和仿真实验证明，改进后的系统在保证查询效率的同时，安全性得到了提升。
最后，在资源发布和搜索阶段的安全威胁，主要包括系统可用性和资源真实性的问题。本文在系统可用性方面的工作主要针对DHT结构，研究了在典型应用eMule的KAD网络下，基于关键词的索引资源在ID空间分布上的不均衡问题，给出了一种基于多重目标ID的索引发布和搜索机制，通过仿真实验证明该机制能够有效的提高索引负载均衡性。在资源真实性方面，本文给出了一种适用于P2P文件共享系统的资源评价模型(FRep)，并详细介绍了FRep的评价收集机制，节点选择机制，评价质疑机制，激励与惩罚机制以及历史评价交换机制，分析了该模型能够抵御大规模欺骗攻击的能力。最后通过对比实验证明FRep比起已有的信誉模型能更好的抵御外来攻击，同时具有更好的计算和通信效率。
总体而言，本文对P2P文件共享网络的安全性问题进行了系统的研究，深入地分析了其行为周期模型中不同阶段下的安全威胁，提出了提高其安全性的技术和方法，对未来P2P网络研究的继续开展具有指导意义。
As one of the most rapidly developed technology on the Internet in the earlypart of this century, P2P technology adhering to the initial design concept ofInternet, get rid of the difference between server and client, making networkcomputing model develop from decentralized mode to distributed mode, fullyuses resources of terminal equipments at the edge of Internet. Being equal parts,all the members in the network can directly connect and exchange files, and forma larger, more scalable overlay network. More and more P2P based applicationsare coming into being. However, though P2P technology promotes the sharing ofInternet hardware and software, its inherent anonymity, dynamic and opennesscharacters severely threat the security of Internet. Due to the reliability of theservice and the authenticity of the resources can not be guaranteed, and lack ofcontrol and management from a central component, there are morevulnerabilities that can be exploited by attackers in the P2P network. The easyway to share and fast way to route, also provide a platform for rapid spreading ofviruses and worms. Those seriously constraint the further developing of P2Psystem, and even threat the security of the entire Internet. How to improve thesecurity of P2P network has become an important issue to be solved. Thisdissertation analyzes and invests main security threats in P2P file sharing systems.From the point of view of system design, some enhancement methods areproposed.
Firstly， fake-block attack in data transfer phase is a typical resourceconsumption attack, which seriously affect the availability of P2P systems. Thisdissertation studies fake-block attack in BitTorrent system, and creates astochastic mathematics model to give the theoretical upper bound that the attackcan take. Then the WAN experiment in a semi-open environment verifies theharm of fake-block attack in real network, and gives the result that the attack canbring at least3times delay of downloading. Finally a SmartHash algorithm basedcountermeasure is given. Simulation indicates this method is feasible andeffective.
Secondly，routing security issues in peer selecting phase, not only threat theavailability of the system, but also provide a platform for other larger scaledestructive attacks. This dissertation makes attack validation in BT’s MainlinedDHT under actual network environment, proves that index poisoning and routingattack can controls the searching results of DHT network. To solve this securityissue, this dissertation proposes the improved node ID generation mechanism,routing table updating mechanism and the searching path selection mechanism.Theoretical analysis and simulation results show that the improved method canguarantee the query efficiency and system safety.
Lastly， security threats in resource publishing/searching stage includesystem availability and resources authenticity. Research work of systemavailability is mainly focused on DHT structure. We study the keyword loadbalance problem in KAD network of eMule, and give a publishing and searchingimprovement based on the index of multiple target IDs. Simulation experimentsindicate the method can effectively improve the index load balancing. Researchwork of resources authenticity proposes a resource rating model in P2P filesharing system, called FRep, and details introduces votes aggregating mechanism,peer choosing mechanism, challenge mechanism, punishing and encouragemechanism and voting record exchange mechanism, analyzes the ability of FRepto resist large scale deception attacks. Simulation experiments prove FRep ismore powerful to counter against outside attacks and has better computationand communication efficiency.
Overall, this dissertation systematically researches the security problems inP2P file sharing networks, in-depth analyzes different security threats in all stagesof P2P file sharing cycle model. The proposed methods and technologies caneffectively improve the performance and enhance the security of P2P network,which is significant for the future research on P2P network
全文首先系统地介绍了P2P网络的结构及其特点，总结了P2P网络的主要安全问题和研究现状。然后以典型的P2P文件共享系统的行为周期模型为脉络，分别研究了资源发布/搜索，节点选择，分块选择以及数据传输四个不同阶段下的主要安全威胁，并从系统设计的角度，针对性的提出了改进P2P网络安全性的方法。
首先，在数据传输阶段和分块选择阶段存在的假块污染攻击，属于典型的资源消耗攻击，严重的影响了P2P系统的可用性。本文以BitTorrent为研究对象，通过建立假块污染攻击的随机模型给出了攻击所能达到的理论上限。然后在半开放环境下进行了广域网实验，验证了假块污染攻击对实际应用的危害，得出污染攻击至少可以带来3倍以上的下载延迟。最后提出了对抗假块污染攻击的SmartHash算法，并从多个角度对其进行了优化，通过仿真实验的方式评价了该算法的有效性和可行性。
其次，在节点选择阶段的路由安全问题，不仅威胁到了系统的可用性，同时为其他更具破坏性的大规模网络攻击提供了实施平台。本文在实际网络环境下，针对BT的Mainline DHT进行了攻击验证，证明通过索引毒害和路由攻击的方式可以控制DHT的搜索结果。为了解决这一问题，本文提出了改进的节点ID生成机制、路由表更新机制以及搜索路径选择机制，通过理论分析和仿真实验证明，改进后的系统在保证查询效率的同时，安全性得到了提升。
最后，在资源发布和搜索阶段的安全威胁，主要包括系统可用性和资源真实性的问题。本文在系统可用性方面的工作主要针对DHT结构，研究了在典型应用eMule的KAD网络下，基于关键词的索引资源在ID空间分布上的不均衡问题，给出了一种基于多重目标ID的索引发布和搜索机制，通过仿真实验证明该机制能够有效的提高索引负载均衡性。在资源真实性方面，本文给出了一种适用于P2P文件共享系统的资源评价模型(FRep)，并详细介绍了FRep的评价收集机制，节点选择机制，评价质疑机制，激励与惩罚机制以及历史评价交换机制，分析了该模型能够抵御大规模欺骗攻击的能力。最后通过对比实验证明FRep比起已有的信誉模型能更好的抵御外来攻击，同时具有更好的计算和通信效率。
总体而言，本文对P2P文件共享网络的安全性问题进行了系统的研究，深入地分析了其行为周期模型中不同阶段下的安全威胁，提出了提高其安全性的技术和方法，对未来P2P网络研究的继续开展具有指导意义。
As one of the most rapidly developed technology on the Internet in the earlypart of this century, P2P technology adhering to the initial design concept ofInternet, get rid of the difference between server and client, making networkcomputing model develop from decentralized mode to distributed mode, fullyuses resources of terminal equipments at the edge of Internet. Being equal parts,all the members in the network can directly connect and exchange files, and forma larger, more scalable overlay network. More and more P2P based applicationsare coming into being. However, though P2P technology promotes the sharing ofInternet hardware and software, its inherent anonymity, dynamic and opennesscharacters severely threat the security of Internet. Due to the reliability of theservice and the authenticity of the resources can not be guaranteed, and lack ofcontrol and management from a central component, there are morevulnerabilities that can be exploited by attackers in the P2P network. The easyway to share and fast way to route, also provide a platform for rapid spreading ofviruses and worms. Those seriously constraint the further developing of P2Psystem, and even threat the security of the entire Internet. How to improve thesecurity of P2P network has become an important issue to be solved. Thisdissertation analyzes and invests main security threats in P2P file sharing systems.From the point of view of system design, some enhancement methods areproposed.
Firstly， fake-block attack in data transfer phase is a typical resourceconsumption attack, which seriously affect the availability of P2P systems. Thisdissertation studies fake-block attack in BitTorrent system, and creates astochastic mathematics model to give the theoretical upper bound that the attackcan take. Then the WAN experiment in a semi-open environment verifies theharm of fake-block attack in real network, and gives the result that the attack canbring at least3times delay of downloading. Finally a SmartHash algorithm basedcountermeasure is given. Simulation indicates this method is feasible andeffective.
Secondly，routing security issues in peer selecting phase, not only threat theavailability of the system, but also provide a platform for other larger scaledestructive attacks. This dissertation makes attack validation in BT’s MainlinedDHT under actual network environment, proves that index poisoning and routingattack can controls the searching results of DHT network. To solve this securityissue, this dissertation proposes the improved node ID generation mechanism,routing table updating mechanism and the searching path selection mechanism.Theoretical analysis and simulation results show that the improved method canguarantee the query efficiency and system safety.
Lastly， security threats in resource publishing/searching stage includesystem availability and resources authenticity. Research work of systemavailability is mainly focused on DHT structure. We study the keyword loadbalance problem in KAD network of eMule, and give a publishing and searchingimprovement based on the index of multiple target IDs. Simulation experimentsindicate the method can effectively improve the index load balancing. Researchwork of resources authenticity proposes a resource rating model in P2P filesharing system, called FRep, and details introduces votes aggregating mechanism,peer choosing mechanism, challenge mechanism, punishing and encouragemechanism and voting record exchange mechanism, analyzes the ability of FRepto resist large scale deception attacks. Simulation experiments prove FRep ismore powerful to counter against outside attacks and has better computationand communication efficiency.
Overall, this dissertation systematically researches the security problems inP2P file sharing networks, in-depth analyzes different security threats in all stagesof P2P file sharing cycle model. The proposed methods and technologies caneffectively improve the performance and enhance the security of P2P network,which is significant for the future research on P2P network
引文
[1] BitTorrent[M/OL]. http://bitconjurer.org/BitTorrent
[2] eMule[M/OL]. http://www.emule-project.net.
[3] H. Chen, M. Yang, J. Han, et al. Maze: a Social Peer-to-peer Network[C].Proceedings of the IEEE International Conference on E-CommerceTechnology for Dynamic E-Business, Beijing,2004:290-293.
[4] Y. Huang, T. Z.J. Fu, D. Chiu, et al. Challenges, design and analysis of a large-scale p2p-vod system[C]. Proceedings of the ACM SIGCOMM2008conference on Data communication (SIGCOMM’08), Seattle, W, US,2008:375-388.
[5] X. Liao, H. Jin, Y. Liu, et al. AnySee: Peer-to-Peer Live Streaming[C].Proceedings of the25th IEEE International Conference on ComputerCommunications (INFOCOM’06), Barcelona, Spain,2006:1-10.
[6] Skype[M/OL]. http://www.skype.com.
[7] SETI@home[M/OL]. http://setiathome.berkeley.edu.
[8]中国互联网络信息中心.第30次中国互联网络发展状况统计报告[M/OL].http://www.cnnic.cn/hlwfzyj/hlwxzbg/hlwtjbg/201207/P020120723477451202474.pdf
[9] Benjamin[M/OL].http://siliconvalley.internet.com/news/article.php/3531_1141841.
[10] KaZaA[M/OL]. http://www.kazaa.com.
[11] Gnuman[M/OL].http://www.symantec.com/avcenter/venc/data/w32.gnuman.worm.html.
[12] Gnutella[M/OL]. http://rfc-gnutella.sourceforge.net.
[13] Viruslist[M/OL].http://www.viruslist.com/en/virusesdescribed?chapter=153311928.
[14] I. Arce, E. Levy. An Analysis of the Slapper Worm[J]. IEEE Security andPrivacy,2003,1(1):82–87
[15] J. Grizzard, V. Sharma, C. Nunnery. Peer-to-Peer Botnets:Overview and CaseStudy[C]. Proceedings of the first Workshop on Hot Topics in Under-standingBotnets (HotBots’07), FCambridge, US,2007
[16]方滨兴,崔翔,王威.僵尸网络综述[J].计算机研究与发展,2011,48(8):1315-1331
[17]江健,诸葛建伟,段海新,吴建平,僵尸网络机理与防御技术[J].软件学报,2012,23(1):82-96.
[18]李书豪,云晓春,郝志宇,翟立东. MRRbot:基于冗余机制的多角色P2P僵尸网络模型[J].计算机研究与发展,2011,48(8):1488-1496
[19]郑纬民,胡进锋,代亚非等.对等计算研究概论[M].中国计算机学会通讯,2005:38-51.
[20] Napster[M/OL]. http://www.napster.com
[21] eDonkey2000[M/OL].http://emulefans.com.
[22] FS2You[M/OL]. http://www.fs2you.com.
[23] D. N. DeVossa, J. E. Porter. Why Napster Matters to Writing: Filesharing as aNew Ethic of Digital Delivery[J]. Computers and Composition,2006,23(2):178-210.
[24] Q. Lv, P. Cao, E. Cohen, et al. Search and replication in unstructured peer-to-peer networks[C]. Proceedings of the16th international conference onSupercomputing (ICS’02), New York, US,200284-95.
[25] C. Gkantsidis, M. Mihail, A. Saberi. Random walks in peer-to-peer networks:algorithms and evaluation[J]. Performance Evaluation (PE), HongKong, CN,2006,63(3):241-263.
[26] V. Kalogeraki, D. Gunopulos, D. Zeinalipour-Yazti. A local search mechanismfor peer-to-peer networks[C]. Proceedings of the eleventh internationalconference on Information and knowledge management, McLean, Virginia,USA,2002:1-8.
[27] I. Clarke, O. Sandberg, B. Wiley, T. W. Hong. Freenet: A distributedanonymous information storage and retrieval system[C]. Proceedings of theWorkshop on Design Issues in Anonymity and Unobservability, Berkeley, CA,USA,2000:311-320.
[28] S. Ratnasamy, P. Francis, M. Handley, et al. A scalable content-addressablenetwork[J]. Computer Communication Review (CCR),2001,31(4):161-172.
[29] I. Stoica, R. Morris, David Karger, et al. Chord: A Scalable Peer-to-peerLookup Service for Internet Applications[C]. Proceedings of the2001conference on Applications, technologies, architectures, and protocols forcomputer communications, San Diego, CA, USA,2001:149-160.
[30] A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object locationand routing for large-scale peer-to-peer systems[C]. Proceedings ofIFIP/ACM International Conference on Distributed Systems Platforms(Middleware), Heidelberg, Germany,2001:329-350.
[31] B. Y. Zhao, J. Kubiatowicz and A. D. Joseph. Tapestry: An infrastructure forfault-tolerant wide-area location and routing[M]. UC Berkeley: TechnicalReport,2001.
[32] K. Aberer. P-Grid: A self-organizing access structure for P2P informationsystems[C]. Proceedings of the6th international conference on cooperativeinformation systems (CoopIS2001), Trento, Italy,2001:179-194.
[33] P. Maymounkov and D. Mazières. Kademlia: A Peer-to-Peer InformationSystem Based on the XOR Metric[C]. Proceedings of the First InternationalWorkshop on Peer-to-Peer System (IPTPS’02), Cambridge, M, US,200253-65.
[34] E. Adar, B. A. Huberman. Free riding on Gnutella[M]. Xerox PARC: TechnicalReport,2000.
[35] J. R. Douceur. The sybil attack[C]. Proceedings of the First InternationalWorkshop on Peer-to-Peer Systems,2002:251-260.
[36] M. Steiner, T. En-najjary and E. W. Biersack. Exploiting KAD: Possible usesand misuses[J]. ACM SIGCOMM Computer Communication Review (CCR),2007,37(5):65-70.
[37] P. Dhungel, D. Wu, and K. W. Ross. Measurement and mitigation ofbittorrent leecher attacks[J]. Computer Communication,2009,32(17):1852–1861.
[38] P. Dhungel, X. Hei, K.W. Ross, and N. Saxena. The pollution attack in p2p livevideo streaming: measurement results and defenses[C]. Proceedings of the2007workshop on Peer-to-peer streaming and IP-TV, Kyoto, Japan,2007:323–328.
[39] Q. Wang, L. Vu, K. Nahrstedt, and H. Khurana. Mis: malicious nodesidentification scheme in network-coding-based peer-to-peer streaming[C].Proceedings of the29th conference on Information communications(INFOCOM2010), Piscataway, NJ, USA,2010:296–300.
[40] FastTrack[M/OL]. http://developer.berlios.de/projects/gift-fasttrack.
[41] Overnet[M/OL]. www.overnet.com.
[42] J. Liang, N. Naoumov and K.W. Ross. The Index Poisoning Attack in P2P File-Sharing Systems[C]. Proceedings of the25th Annual IEEE Conference onComputer Communications (INFOCOM’06), Barcelona, Spain,20061-12.
[43] J. Liang, R. Kumar, Y. Xi and K.W. Ross. Pollution in P2P File SharingSystems[C]. Proceedings of the24th Annual IEEE Conference on ComputerCommunications (INFOCOM’05), Miami, FL, US,20051174-1185.
[44] N. Naoumov and K. Ross. Exploiting P2P systems for DDoS attacks[C].Proceedings of the1st international conference on Scalable informationsystems (InfoScale’06), New York, NY,200647-53.
[45] K. E. Defrawy, M. Gjoka and A. Markopoulou. BotTorrent: misusingBitTorrent to launch DDoS attacks[C]. Proceedings of the3rd USENIXworkshop on Steps to reducing unwanted traffic on the internet, USA:USENIX Association, Santa Clara, CA,2007:1-6.
[46] M. Steiner, T. En-Najjary and E. W. Biersack. A global view of kad[C].Proceedings of the7th ACM SIGCOMM conference on Internetmeasurement (IMC’07), San Diego, C, USA,2007:117-122.
[47] K. Hildrum, J. Kubiatowicz. Asymptotically efficient approaches to fault-tolerance in peerto-peer networks[C]. Proceedings of the17th internationalsymposium on distributed computing (DISC’03), Sorrento, Italy,2003321-336.
[48] A. Singh, T. W. Ngan, P. Druschel, and D. S. Wallach. Eclipse attacks onoverlay networks: threats and defenses[C]. Proceedings of the25thINFOCOM conference, Barcelona, Spain,2006:1–12.
[49] E. Sit and R. T. Morris. Security Considerations for Peer-to-Peer DistributedHash Tables[C]. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS’02), Cambridge, M,2002261-269.
[50]张宇翔,杨冬,张宏科. P2P网络中Churn问题研究[J].软件学报,2009,20(5):1362-1376.
[51]付志鹏,王怀民,史殿习.对等网络的抖动特性研究综述[J].计算机学报,2011,36(9):1563-1577.
[52] P. Dhungel, D. Wu, B. Schonhorst, K. W. Ross. A measurement study ofattacks on BitTorrent lechers[C]. Proceedings of the7th InternationalWorkshop on Peer to Peer Systems (IPTPS’08), Tampa Bay, FL, USA,2008:1-6.
[53] D. Hughes, G. Coulson, and J. Walkerdine. Free riding on gnutella revisited:The bell tolls?[J]. IEEE Distributed Systems Online,2005,6(6):1-18.
[54] M. Zghaibeh and F. C. Harmantzis. Revisiting free riding and the tit-for-tat inbittorrent: Ameasurement study[J]. Peer-to-Peer Networking andApplications,2008,1(2):162-173.
[55] M. Zghaibeh, K. G. Anagnostakis, and F. C. Harmantzis. The behavior of freeriders in bit torrent networks[J]. Handbook of Peer-to-Peer Networking.Springer US,2010, Part11:1207–1230.
[56] S. B. Handurukande, A. M. Kermarrec, F. Le Fessant, L. Massouli′e, and S.Patarin. Peer sharing behaviour in the edonkey network, and implicationsfor the design of server-less file sharing systems[J]. ACM SIGOPS OperatingSystems Review,2006,40(4):359-371.
[57] B. Cohen. Incentives build robustness in BitTorrent[C]. Proceedings of the1st Workshop on Economics of Peer-to-Peer Systems, June2003.
[58] T. Locher, P. Moor, S. Schmid, et al. Free Riding in BitTorrent is Cheap[C].Proceedings of the5th Workshop on Hot Topics in Networks Irvine, USA,2006:85-90.
[59] N. Liogkas, R. Nelson, E. Kohler, et al. Exploiting BitTorrent for fun (but notproft) C Proceedings of the5th International Workshop on Peer-to-PeerSystems (IPTPS’06), Santa Barbara, California,2006
[60] M. Sirivianos, J. H. Park, R. Chen, et al. Free-riding in BitTorrent networkswith the large view exploit[C]. Proceedings of the5th InternationalWorkshop on Peer-to-Peer Systems (IPTPS’07),2007
[61] M. Piatek, T. Isdal, T. Anderson, et al. Do incentives build robustness inBitTorrent[C]? Proceedings of the4th USENIX Symposium on NetworkedSystems Design&Implementation, Cambridge, MA,2007:1-14.
[62] A. R. Bharambe, C. Herley, and V. N. Padmanabhan. Analyzing and improvinga bittorrent networks performance mechanisms[C]. Proceedings of the25thconference on Information communications (INFOCOM’06), Barcelona,Spain,2006:1-12.
[63] M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani. Doincentives build robustness in bit torrent[C]. Proceedings of the4th USENIXconference on Networked systems design&implementation, CA, USA,2007.
[64] D. Levin, K. LaCurts, N. Spring, and B. Bhattacharjee. Bittorrent is an auction:analyzing and improving bittorrent’s incentives[C]. Proceedings of the ACMSIGCOMM2008conference on Data communication. Seattle, WA, USA,2008:243-254.
[65] J. Mol, J. Pouwelse, M. Meulpolder, D. Epema, and H. Sips. Give-to-get:Free-riding-resilient video-on-demand in p2p systems[C]. Proceedings ofMultimedia Computing and Networking conference, San Jose, California,USA,2008.
[66] D. Levin, J. R. Douceur, J. R. Lorch, and T. Moscibroda. Trinc: small trustedhardware for large distributed systems[C]. Proceedings of the6th USENIXsymposium on Networked systems design and implementation (NSDI’09),Berkeley, CA, USA,2009:1-14.
[67] F. D. Garcia and J. henk Hoepman. Off-line karma: A decentralized currencyfor peer-to-peer and grid applications[C]. Proceedings of the3rd AppliedCryptography and Network Security conference (ACNS). Springer,2005:364-377.
[68] V. Vishnumurthy, S. Chandrakumar, and E. G. Sirer. Karma: A secureeconomic framework for p2p resource sharing[C]. Proceedings of the2005Conf. of the Centre for Advanced Studies on Collaborative research. IBMPress,2005:185-199.
[69] M. Sirivianos, J. H. Park, X. Yang, and S. Jarecki. Dandelion: Cooperativecontent distribution with robust incentives[C]. Proceding of the2007USENIX Annual Technical Conference,2007:157–170.
[70] T. Locher, S. Schmid, and R. Wattenhofer. Rescuing tit-for-tat with sourcecoding[C]. Proceedings of the7th IEEE International Conferenceon Peer-to-Peer Computing (P2P2007), Galway, Ireland,2007:3–10.
[71] J Pouwelse, P Garbacki, D Epema, H Sips. The Bittorrent P2P file-sharingsystem: Measurements and analysis[C]. Proceedings of the54thInternational Workshop on Peer-to-Peer Systems, Ithaca, USA,2005:205-216.
[72] N. Christin, AS. Weigend, J. Chuang. Content availability, pollution andpoisoning in peer-to-peer file sharing networks[C]. Proceedings of the6thACM Conference on Electronic Commerce (EC’05), Vancouver, BC, Canada,2005:68-77.
[73] Q. Gu, K. Bai, H. Wang, P. Liu, C. H. Chu. Modeling of pollution in p2p filesharing systems[C]. Proceedings of the3rd IEEE Consumer Communicationsand Networking Conference (CCNC2006),2006:1033-1037.
[74] R. Thommes, M. Coates. Epidemiological Modeling of Peer-to-Peer Virusesand Pollution[C]. Proceedings of the25th IEEE International Conference onComputer Communications (INFOCOM’06), Barcelona, Spain,2006:1-12.
[75] U. Lee, M. Choi, J. Cho, M. Y. Sanadidi, M. Gerla. Understanding PollutionDynamics in P2P File Sharing[C]. Proceedings of the5th InternationalWorkshop on Peer-to-Peer Systems (IPTPS’06),2006.
[76] R. Kumar, D. Yao, A. Bagchi, K. W. Ross, D. Rubenstein. Fluid modeling ofpollution proliferation in P2P networks[C]. Proceedings of SIGMET-RICSPerformance evaluation review SESSION,2006:335-346.
[77] C. Shi, D. Y. Han, X. Y. Hu, and Y. Yu. A unified model of pollution in P2Pnetworks[C]. Proceedings of the22nd IEEE International Parallel&Distributed Processing Symposium (IPDPS’08), Miami, Florida, USA,2008:1-12.
[78] J. Liang, N. Naoumov, K. W. Ross. Efficient blacklisting and pollution-levelestimation in P2P file-sharing systems[C]. Proceedings of the first Asianinternet engineering conference on technologies for advancedheterogeneous networks,2005:1-21.
[79] K. Walsh, E. G. Sirer. Fighting Peer-to-Peer SPAM and Decoys with ObjectReputation[C]. Proceedings of SIGCOM-M’05Workshop on Economics ofPeer-to-Peer System. Philadelphia, USA,2005:138-143.
[80] K. G. Dastidar, T. Herman and C. Johnen. Safe peer-to-peer self-downloading[J]. ACM Transactions on Autonomous and Adaptive Systems(TAAS).2008,3(4):1-18.
[81] M. Zuo, Y. H. Ma, R. Chbeir, J. H. Li. Combating P2P File Pollution with Co-alerting[C]. Proceedings of the third international IEEE Conference onSignal-Image Technologies and Internet-Based System (SITIS’07), Shanghai,China,2007:289-297.
[82] R. C. Chen, E. K. Lua, J. Crowcroft, C. Tang, L. Tang and Z. Chen. Phagocytes:A Holistic Defense and Protection Against Active P2P Worms[C]. Proceedingsof the6th USENIX Symposium on Networked Systems Design andImplementation (NSDI’09), Boston, US,2009
[83] Media Defender[M/OL]. http://www.mediadefender.com.
[84] Safenet[M/OL]. http://www.safenet-inc.com.
[85] A. Shamir. Identity-based cryptosystems and signature schemes[C].Proceedings of CRYPTO84on Advances in cryptology, New York, NY, USA,1985:47-53.
[86] J. Newsome, E. Shi, D. X. Song, and A. Perrig. The Sybil attack in sensornetworks: analysis&defenses[C]. Proceedings of the3rd Int’l Symp. OnInformation Processing in Sensor Networks (IPSN’04), Berkeley, USA,2004:259-268.
[87] H. Rowaihy, W. Enck, P. McDaniel, and T. La Porta. Limiting sybil attacks instructured p2p networks[C]. Proceeding of the26th IEEE InternationalConference on Computer Communications (INFOCOM’07).2007:2596-2600.
[88] M. J. Freedman and R. Morris. Tarzan: a peer-to-peer anonymizing networklayer[C]. Proceedings of the9th ACM conference on Computer andcommunications security. New York, NY, USA,2002:193-206.
[89] H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. Sybilguard: defendingagainst sybilattacks via social networks[C]. Proceedings of the2006conference on Applications, technologies, architectures, and protocols forcomputer communications, New York, NY, USA,2006:267-278.
[90] H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. Sybillimit: A near-optimalsocial network defense against sybil attacks[J]. IEEE/ACM Transactions onNetworking (TON),2010,18(3):885-898.
[91] N. Tran, B. Min, J. Li, and L. Subramanian. Sybil-resilient online contentvoting[C]. Proceedings of the6th USENIX symposium on Networked systemsdesign and implementation (NSDI’09), Berkeley, CA, USA,2009:15-28.
[92] S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The eigentrustalgorithm for reputation management in p2p networks[C]. Proceedings ofthe12th international conferenceon World Wide Web (WWW’03), NewYork, NY, USA,2003:640-651.
[93] K. Walsh and E. G. Sirer. Experience with an object reputation system forpeer-to-peer file sharing[C]. Proceedings of the3rd conference onNetworked Systems Design&Implementation (NSDI’06). Berkeley, CA, USA,2006.
[94] C. Costa, V. Soares, J. Almeida, and V. Almeida. Fighting pollutiondissemination in peer-topeer networks[C]. Proceedings of the2007ACMsymposium on Applied computing (SAC’07), New York, NY, USA,2007:1586-1590.
[95] S. Marti and H. Garcia-Molina. Identity crisis: Anonymity vs. reputation inp2p systems[C]. Proceedings of the3rd International Conference on Peer-to-Peer Computing (P2P’03), Washington, DC, USA,2003:134-141.
[96] A. Cheng and E. Friedman. Sybilproof reputation mechanisms[C].Proceedings of the2005ACM SIGCOMM workshop on Economics of peer-to-peer systems (P2PECON’05), New York, NY, USA,2005:128-132.
[97] R. Landa, D. Griffin, R. G. Clegg, E. Mykoniati, and M. Rio. A sybilproofindirect reciprocity mechanism for peer-to-peer networks[C]. Proceedingsof the28th IEEE Conference on Computer Communications (INFOCOM’09),Rio de Janeiro, Brazil,2009:343-351.
[98] H. Yu, C. Shi, M. Kaminsky, P. B. Gibbons, and F. Xiao. Dsybil: Optimal sybil-resistance for recommendation systems[C]. Proceedings of the30th IEEESymposium on Security and Privacy (SP’09), Oakland, California, USA,2009:283-298.
[99] M. Piatek, T. Isdal, A. Krishnamurthy, and T. Anderson. One hop reputationsfor peer to peer file sharing workloads[C]. Proceedings of the5th USENIXSymposium on Networked Systems Design and Implementation (NSDI’08),Berkeley, CA, USA,2008:1-14.
[100] Q. Lian, Y. Peng, M. Yang, Z. Zhang, Y. Dai, and X. Li. Robust incentives viamulti-level titfor-tat: Research articles[J]. Concurrency and Computation:Practice&Experience.2008,20(2):167-178.
[101] J. Falkner, M. Piatek, J. P. John, et al. Profiling a million user DHT[C].Proceedings of the7th ACM SIGCOMM conference on Internetmeasurement (IMC’07), San Diego, CA, USA,2007:129-134.
[102] A. Parker. The true picture of Peer-To-Peer file-sharing[C]. Proceedings ofIEEE10th Int'l Workshop on Web Content Caching and Distribution, SophiaAntipolis, France,2005.
[103] H. Schulze and K. Mochalski, Ipoque. internet study2008/2009.[M/OL].http://www.ipoque.com/study/ipoque-Internet-Study-08-09.pdf
[104] L. Massoulié and M. Vojnovi′c. Coupon Replication Systems[C]. Proceedingsof the2005ACM SIGMETRICS international conference on Measurementand modeling of computer systems (SIGMETRICS’05), Banff, B, Canada,2005:2-13.
[105] P. Dhungel, X. Hei, D. Wu, and K. W. Ross. A measurement studay of attackson bittorrent seeds[C]. Proceedings of IEEE International Conference onCommunications (ICC’2011), Kyoto, Japan,2011:1-5.
[106] K. Shin, D. S. Reeves, and I. Rhee. Treat-before-trick: Free-riding preventionfor bittorrent-like peer-to-peer networks[C]. Proceedings of the2009IEEEInternational Symposium on Parallel&Distributed Processing (IPDPS’09),Rome, Italy,2009:1-12.
[107] M. A. Konrath, M. P. Barcellos, and R. B. Mansilha. Attacking a swarm with aband of liars: evaluating the impact of attacks on bittorrent[C]. Proceedingsof the Seventh IEEE International Conference on Peer-to-Peer Computing(P2P’07), Galway, Ireland,2007:37-44.
[108] J. K. So and D. Reeves. Defending against sybil nodes in bittorrent[C].Proceedings of the10th international IFIP TC6conference on Networking(NETWORKING’11),2011:25-39.
[109] M. P. Barcellos, D. Bauermann, H. Sant’anna, M. Lehmann, R. Mansilha.Protecting BitTorrent: design and evaluation of effective countermeasuresagainst DoS attacks[C]. Proceedings of the27th International Symposium onReliable Distributed Systems (IEEE SRDS2008), Naples,2008:73-82
[110] D. Bertsekas, R. Gallager. Data Networks[M]. Englewood Cliffs, NJ, PrenticeHall,1987.
[111] A. Legout, N. Liogkas, E. Kohler, and L. X. Zhang. Clustering and sharingincentives in BitTorrent systems[C]. Proceedings of the2007ACMSIGMETRICS international conference on Measurement and modeling ofcomputer systems. New York, USA,2007:301312
[112] C. Chan, S. Chan, Distributed Hash Tables: Design and Applications[C].Handbook of Peer-to-Peer Networking. Springer Science,2010:257-280.
[113] G. Urdaneta, G. Pierre, and M. van Steen.A survey of dht securitytechniques[J]. ACM Computing Surveys,2011,43(2): Article No.8.
[114] B. Neil, L. C. Shields, N. B. Margolin. A survey of solutions to the sybilattack[R]. Amherst: University of Massachusetts Amherst,2006.
[115] A. Singh, M. Castro, P. Druschel, and A. Rowstro. Defending against eclipseattacks on overlay networks[C]. Proceedings of the11th workshop on ACMSIGOPS European workshop,2004: Article No.21.
[116] R. Villanueva, M. Villamil and R. Arnedo. Secure routing strategies in DHT-based systems[C]. Proceedings of the third International conference on Datamanagement in grid and peer-to-peer systems. Springer,2010:62-74.
[117] R. Villanueva, M. Villamil. SecureRoutingDHT: A Protocol for ReliableRouting in P2P DHT-based Systems[C].Proceedings of the7th InternationalConference on Internet and Web Applications and Services (ICIW2012),Stuttgart, Germany,2012:260-267.
[118] M Sa nchez-r gas, P Garc a-Lo pez, and Go mez. A novel methodologyfor constructing secure multi-path overlay[J]”, IEEE Internet Computing,2005,9(6):50-57.
[119] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach. Securerouting for structured peer-to-peer overlay networks[C]. Proceedings of the5th Symposium on Operating Systems Design and Implementation, ACMPress,2002:299-314
[120] C. Harvesf and D. Blough. Replica placement for route diver-sity in tree-based routing distributed hash tables[J]. IEEE Transactions on Dependableand Secure Computing,2009,8(3):419-433.
[121] M. Naor and U. Wieder. A simple Fault Tolerant Distributed Hash Table[C].Proceedings of the2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03),Springer,2003:88-97.
[122] M. Young, A. Kate, I. Goldberg, and M. Karsten. Prac-tical robustcommunication in DHTs tolerating a byzan-tine adversary[C]. Proceedings ofthe30th Int. Conf. on Distributed Computing Systems,2010:263-272.
[123] M Sa nchez-r gas, P Garc a-Lo pez, and Go mez. By-pass: providingsecure DHT routing through bypassing ma-licious peers[C]. Proceedings ofSymposium on Computers and Communications,2008:934-941.
[124] M. Srivatsa and L. Liu. Vulnerabilities and security threats in structuredoverlay networks: A quantitative analysis[C]. Proceedings of the20thAnnual Computer Security Applications Conference,2004:252-261.
[125] P. Wang, L. Osipkov, N. Hopper, and Y. Kim. Myrmic: secure and robust DHTrouting[M]. Technical report, University of Minnesota-Twin cities,2006.
[126] K. Needels and M. Kwon. Secure routing in peer-to-peer distributed hashtables[C]. Proceedings of the Symposium on Applied Computing, ACM,2009:54-58.
[127] B. Roh, O. Kwon, S. Hong, and J. Kim. The exclusion of malicious routingpeers in structured P2P systems[C]. Proceedings of the5th Int. Workshop onAgents and Peer-to-Peer Computing, Springer,2006:43-50.
[128] S. Marti, P. Ganesan and H. Garcia-Molina. DHT routing using social links[C].Proceedings of the3rd International Workshop on Peer-to-Peer Systems(IPTPS’04), Springer,2004:100-111.
[129] M Sa nchez-r gas and P Garc a-Lo pez. On routing in distributed hashtables: is reputation a shelter from mali-cious behavior and churn?[C].Proceedings of the9th Int. Conf. on Peer-to-Peer Computing,2009:31-40.
[130] M Sa nchez-r gas, P Garc a-Lo pez, and Go mez. Secure forwarding inDHTs-is redundancy the key to robustness?[C]. Proceedings of the14thInternational European Conference on Parallel and Distributed Computing,Springer,2008:611-621.
[131] N. Fedotova, M. Bertucci, and Veltri. Reputation management techniques inDHT-based peer-to-peer networks[C]. Proceedings of the2nd Int. Conf. onInternet and Web Applications and Services, IEEE Press,2007: pp.4
[132] G. Danezis, C. Lesniewski-Laas, M. Kaashoek, and R. Ander-son. Sybil-resistant DHT routing[C]. Proceedings of the10th European Symposium onResearch In Computer Security, Springer,2005:305-318.
[133] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Securerouting for structured peer-to-peer overlay networks[C]. Proceedings of the5th symposium on Operating systems design and implementation,2002,36(SI):299-314.
[134] I. Baumgart and S. Mies. S/kademlia: A practicable approach towards securekeybased routing[C]. Proceedings of the2007International Conference onParallel and Distributed Systems, Hsinchu,2007:1-8.
[135] D. Cerri, A. Ghioni, S. Paraboschi, and S. Tiraboschi. ID mapping attacks inp2p networks[C]. Proceedings of the2005IEEE Global TelecommunicationsConference (GLOBECOM2005), St. Louis, MO, USA,2005.
[136] F. Lesueur, L. Me, and V.V.T. Tong. An efficient distributed pki for structuredp2p networks[C]. Proceedings of the9th IEEE Int'l Conference on Peer-to-Peer Computing (P2P’09), Seattle, Washington, USA,2009:1-10.
[137] S. Marti, P. Ganesan, and H. Garcia-Molina. Dht routing using social links[C].Proceedings of the3rd International Workshop on Peer-to-Peer Systems(IPTPS’04),2004:100-111.
[138] W. Galuba, K. Aberer, Z. Despotovic, and W. Kellerer. Authentication-freefault tolerant peer-to-peer service provisioning[C]. Proceedings ofDatabases, Information Systems, and Peer-to-Peer Computing (DBISP2P’07),2007.
[139] Stutzbach and R. Rejaie. Improving Lookup Performance over a Widely-Deployed DHT[C]. Proceedings of the25th IEEE Conference on ComputerCommunications (INFOCOM’06), Barcelona, Spain,20061-12.
[140] S. Ren, L. Guo, S. Jiang and X. Zhang. SAT-Match: A self-adaptive topologymatching method to acheive low lookup latency in structured P2P overlaynetworks[C]. Proceedings of the18th International Parallel and DistributedProcessing Symposium,2004:83-91.
[141] B. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hashtables[C]. Proceedings of the24th Annual Joint Conference of the IEEEComputer and Communications Societies (INFOCOM’05), Miami, USA,2005:596-606.
[142] A. Rao，K. Lakshminaraynan, S. Surana, R. Karp, I. Stoica. Load balancing instructured P2P systems[C]. Proceedings of the2nd International WorkshopPeer-to-Peer systems (IPTPS’03). Berkeley, USA,2003:68-79.
[143] H. C. Hsiao, C. W. Chang, A Symmetric Load Balancing Algorithm withPerformance Guarantees for Distributed Hash Tables[J]. IEEE Transactionson Computers,2012, PP(99):1.
[144]张宇翔，张宏科.一种层次结构化P2P网络中的负载均衡方法[J].计算机学报，2010,33(9):1580-1590.
[145] M. Steiner, W. Effelsberg, T. En-Najjary, and E. W. Biersack. Load reduction inthe KAD peer-to-peer system[C]. Proceeding of the Fifth InternationalWorkshop on Databases, Information Systems and Peer-to-Peer Computing(DBISP2P), Vienna, Austria,2007.
[146] Moritz Steiner, Taoufik En-Najjary, and Ernst W. Biersack. Long Term Studyof Peer Behavior in the KAD DHT[J]. IEEE/ACM Transactions on Networking,2009,17(5):1371-1384.
[147]夏春和,石昀平,李肖坚.结构化对等网中的P2P蠕虫传播模型研究[J].计算机学报,2006,29(6):952-959.
[148] Xiong L, Liu L. PeerTrust: supporting reputationbased trust for Peer-to-Peerelectronic communities[J]. IEEE transaction on knowledge and dataengineering,2004,16(7):843-857.
[149]窦文,王怀民,贾焰,邹鹏.构造基于推荐的Peer-to-Peer环境下的Trust模型[J].软件学报,2004,15(4):571-583.
[150] C. Lesniewski-Laas. A sybil-proof one-hop DHT[C]. Proceedings of the firstWorkshop onSocial Network Systems (SocialNets’08), Glasgow, Scotland, UK,2008:19-24.
[151] Ingmar B, Bernhard H, Stephan K. OverSim: A Flexible Overlay NetworkSimulation Framework[C]. Proceedings of the10th IEEE Global InternetSymposium, Anchorage, AK, USA,2007:79-84.
[2] eMule[M/OL]. http://www.emule-project.net.
[3] H. Chen, M. Yang, J. Han, et al. Maze: a Social Peer-to-peer Network[C].Proceedings of the IEEE International Conference on E-CommerceTechnology for Dynamic E-Business, Beijing,2004:290-293.
[4] Y. Huang, T. Z.J. Fu, D. Chiu, et al. Challenges, design and analysis of a large-scale p2p-vod system[C]. Proceedings of the ACM SIGCOMM2008conference on Data communication (SIGCOMM’08), Seattle, W, US,2008:375-388.
[5] X. Liao, H. Jin, Y. Liu, et al. AnySee: Peer-to-Peer Live Streaming[C].Proceedings of the25th IEEE International Conference on ComputerCommunications (INFOCOM’06), Barcelona, Spain,2006:1-10.
[6] Skype[M/OL]. http://www.skype.com.
[7] SETI@home[M/OL]. http://setiathome.berkeley.edu.
[8]中国互联网络信息中心.第30次中国互联网络发展状况统计报告[M/OL].http://www.cnnic.cn/hlwfzyj/hlwxzbg/hlwtjbg/201207/P020120723477451202474.pdf
[9] Benjamin[M/OL].http://siliconvalley.internet.com/news/article.php/3531_1141841.
[10] KaZaA[M/OL]. http://www.kazaa.com.
[11] Gnuman[M/OL].http://www.symantec.com/avcenter/venc/data/w32.gnuman.worm.html.
[12] Gnutella[M/OL]. http://rfc-gnutella.sourceforge.net.
[13] Viruslist[M/OL].http://www.viruslist.com/en/virusesdescribed?chapter=153311928.
[14] I. Arce, E. Levy. An Analysis of the Slapper Worm[J]. IEEE Security andPrivacy,2003,1(1):82–87
[15] J. Grizzard, V. Sharma, C. Nunnery. Peer-to-Peer Botnets:Overview and CaseStudy[C]. Proceedings of the first Workshop on Hot Topics in Under-standingBotnets (HotBots’07), FCambridge, US,2007
[16]方滨兴,崔翔,王威.僵尸网络综述[J].计算机研究与发展,2011,48(8):1315-1331
[17]江健,诸葛建伟,段海新,吴建平,僵尸网络机理与防御技术[J].软件学报,2012,23(1):82-96.
[18]李书豪,云晓春,郝志宇,翟立东. MRRbot:基于冗余机制的多角色P2P僵尸网络模型[J].计算机研究与发展,2011,48(8):1488-1496
[19]郑纬民,胡进锋,代亚非等.对等计算研究概论[M].中国计算机学会通讯,2005:38-51.
[20] Napster[M/OL]. http://www.napster.com
[21] eDonkey2000[M/OL].http://emulefans.com.
[22] FS2You[M/OL]. http://www.fs2you.com.
[23] D. N. DeVossa, J. E. Porter. Why Napster Matters to Writing: Filesharing as aNew Ethic of Digital Delivery[J]. Computers and Composition,2006,23(2):178-210.
[24] Q. Lv, P. Cao, E. Cohen, et al. Search and replication in unstructured peer-to-peer networks[C]. Proceedings of the16th international conference onSupercomputing (ICS’02), New York, US,200284-95.
[25] C. Gkantsidis, M. Mihail, A. Saberi. Random walks in peer-to-peer networks:algorithms and evaluation[J]. Performance Evaluation (PE), HongKong, CN,2006,63(3):241-263.
[26] V. Kalogeraki, D. Gunopulos, D. Zeinalipour-Yazti. A local search mechanismfor peer-to-peer networks[C]. Proceedings of the eleventh internationalconference on Information and knowledge management, McLean, Virginia,USA,2002:1-8.
[27] I. Clarke, O. Sandberg, B. Wiley, T. W. Hong. Freenet: A distributedanonymous information storage and retrieval system[C]. Proceedings of theWorkshop on Design Issues in Anonymity and Unobservability, Berkeley, CA,USA,2000:311-320.
[28] S. Ratnasamy, P. Francis, M. Handley, et al. A scalable content-addressablenetwork[J]. Computer Communication Review (CCR),2001,31(4):161-172.
[29] I. Stoica, R. Morris, David Karger, et al. Chord: A Scalable Peer-to-peerLookup Service for Internet Applications[C]. Proceedings of the2001conference on Applications, technologies, architectures, and protocols forcomputer communications, San Diego, CA, USA,2001:149-160.
[30] A. Rowstron and P. Druschel. Pastry: Scalable, decentralized object locationand routing for large-scale peer-to-peer systems[C]. Proceedings ofIFIP/ACM International Conference on Distributed Systems Platforms(Middleware), Heidelberg, Germany,2001:329-350.
[31] B. Y. Zhao, J. Kubiatowicz and A. D. Joseph. Tapestry: An infrastructure forfault-tolerant wide-area location and routing[M]. UC Berkeley: TechnicalReport,2001.
[32] K. Aberer. P-Grid: A self-organizing access structure for P2P informationsystems[C]. Proceedings of the6th international conference on cooperativeinformation systems (CoopIS2001), Trento, Italy,2001:179-194.
[33] P. Maymounkov and D. Mazières. Kademlia: A Peer-to-Peer InformationSystem Based on the XOR Metric[C]. Proceedings of the First InternationalWorkshop on Peer-to-Peer System (IPTPS’02), Cambridge, M, US,200253-65.
[34] E. Adar, B. A. Huberman. Free riding on Gnutella[M]. Xerox PARC: TechnicalReport,2000.
[35] J. R. Douceur. The sybil attack[C]. Proceedings of the First InternationalWorkshop on Peer-to-Peer Systems,2002:251-260.
[36] M. Steiner, T. En-najjary and E. W. Biersack. Exploiting KAD: Possible usesand misuses[J]. ACM SIGCOMM Computer Communication Review (CCR),2007,37(5):65-70.
[37] P. Dhungel, D. Wu, and K. W. Ross. Measurement and mitigation ofbittorrent leecher attacks[J]. Computer Communication,2009,32(17):1852–1861.
[38] P. Dhungel, X. Hei, K.W. Ross, and N. Saxena. The pollution attack in p2p livevideo streaming: measurement results and defenses[C]. Proceedings of the2007workshop on Peer-to-peer streaming and IP-TV, Kyoto, Japan,2007:323–328.
[39] Q. Wang, L. Vu, K. Nahrstedt, and H. Khurana. Mis: malicious nodesidentification scheme in network-coding-based peer-to-peer streaming[C].Proceedings of the29th conference on Information communications(INFOCOM2010), Piscataway, NJ, USA,2010:296–300.
[40] FastTrack[M/OL]. http://developer.berlios.de/projects/gift-fasttrack.
[41] Overnet[M/OL]. www.overnet.com.
[42] J. Liang, N. Naoumov and K.W. Ross. The Index Poisoning Attack in P2P File-Sharing Systems[C]. Proceedings of the25th Annual IEEE Conference onComputer Communications (INFOCOM’06), Barcelona, Spain,20061-12.
[43] J. Liang, R. Kumar, Y. Xi and K.W. Ross. Pollution in P2P File SharingSystems[C]. Proceedings of the24th Annual IEEE Conference on ComputerCommunications (INFOCOM’05), Miami, FL, US,20051174-1185.
[44] N. Naoumov and K. Ross. Exploiting P2P systems for DDoS attacks[C].Proceedings of the1st international conference on Scalable informationsystems (InfoScale’06), New York, NY,200647-53.
[45] K. E. Defrawy, M. Gjoka and A. Markopoulou. BotTorrent: misusingBitTorrent to launch DDoS attacks[C]. Proceedings of the3rd USENIXworkshop on Steps to reducing unwanted traffic on the internet, USA:USENIX Association, Santa Clara, CA,2007:1-6.
[46] M. Steiner, T. En-Najjary and E. W. Biersack. A global view of kad[C].Proceedings of the7th ACM SIGCOMM conference on Internetmeasurement (IMC’07), San Diego, C, USA,2007:117-122.
[47] K. Hildrum, J. Kubiatowicz. Asymptotically efficient approaches to fault-tolerance in peerto-peer networks[C]. Proceedings of the17th internationalsymposium on distributed computing (DISC’03), Sorrento, Italy,2003321-336.
[48] A. Singh, T. W. Ngan, P. Druschel, and D. S. Wallach. Eclipse attacks onoverlay networks: threats and defenses[C]. Proceedings of the25thINFOCOM conference, Barcelona, Spain,2006:1–12.
[49] E. Sit and R. T. Morris. Security Considerations for Peer-to-Peer DistributedHash Tables[C]. Proceedings of the First International Workshop on Peer-to-Peer Systems (IPTPS’02), Cambridge, M,2002261-269.
[50]张宇翔,杨冬,张宏科. P2P网络中Churn问题研究[J].软件学报,2009,20(5):1362-1376.
[51]付志鹏,王怀民,史殿习.对等网络的抖动特性研究综述[J].计算机学报,2011,36(9):1563-1577.
[52] P. Dhungel, D. Wu, B. Schonhorst, K. W. Ross. A measurement study ofattacks on BitTorrent lechers[C]. Proceedings of the7th InternationalWorkshop on Peer to Peer Systems (IPTPS’08), Tampa Bay, FL, USA,2008:1-6.
[53] D. Hughes, G. Coulson, and J. Walkerdine. Free riding on gnutella revisited:The bell tolls?[J]. IEEE Distributed Systems Online,2005,6(6):1-18.
[54] M. Zghaibeh and F. C. Harmantzis. Revisiting free riding and the tit-for-tat inbittorrent: Ameasurement study[J]. Peer-to-Peer Networking andApplications,2008,1(2):162-173.
[55] M. Zghaibeh, K. G. Anagnostakis, and F. C. Harmantzis. The behavior of freeriders in bit torrent networks[J]. Handbook of Peer-to-Peer Networking.Springer US,2010, Part11:1207–1230.
[56] S. B. Handurukande, A. M. Kermarrec, F. Le Fessant, L. Massouli′e, and S.Patarin. Peer sharing behaviour in the edonkey network, and implicationsfor the design of server-less file sharing systems[J]. ACM SIGOPS OperatingSystems Review,2006,40(4):359-371.
[57] B. Cohen. Incentives build robustness in BitTorrent[C]. Proceedings of the1st Workshop on Economics of Peer-to-Peer Systems, June2003.
[58] T. Locher, P. Moor, S. Schmid, et al. Free Riding in BitTorrent is Cheap[C].Proceedings of the5th Workshop on Hot Topics in Networks Irvine, USA,2006:85-90.
[59] N. Liogkas, R. Nelson, E. Kohler, et al. Exploiting BitTorrent for fun (but notproft) C Proceedings of the5th International Workshop on Peer-to-PeerSystems (IPTPS’06), Santa Barbara, California,2006
[60] M. Sirivianos, J. H. Park, R. Chen, et al. Free-riding in BitTorrent networkswith the large view exploit[C]. Proceedings of the5th InternationalWorkshop on Peer-to-Peer Systems (IPTPS’07),2007
[61] M. Piatek, T. Isdal, T. Anderson, et al. Do incentives build robustness inBitTorrent[C]? Proceedings of the4th USENIX Symposium on NetworkedSystems Design&Implementation, Cambridge, MA,2007:1-14.
[62] A. R. Bharambe, C. Herley, and V. N. Padmanabhan. Analyzing and improvinga bittorrent networks performance mechanisms[C]. Proceedings of the25thconference on Information communications (INFOCOM’06), Barcelona,Spain,2006:1-12.
[63] M. Piatek, T. Isdal, T. Anderson, A. Krishnamurthy, and A. Venkataramani. Doincentives build robustness in bit torrent[C]. Proceedings of the4th USENIXconference on Networked systems design&implementation, CA, USA,2007.
[64] D. Levin, K. LaCurts, N. Spring, and B. Bhattacharjee. Bittorrent is an auction:analyzing and improving bittorrent’s incentives[C]. Proceedings of the ACMSIGCOMM2008conference on Data communication. Seattle, WA, USA,2008:243-254.
[65] J. Mol, J. Pouwelse, M. Meulpolder, D. Epema, and H. Sips. Give-to-get:Free-riding-resilient video-on-demand in p2p systems[C]. Proceedings ofMultimedia Computing and Networking conference, San Jose, California,USA,2008.
[66] D. Levin, J. R. Douceur, J. R. Lorch, and T. Moscibroda. Trinc: small trustedhardware for large distributed systems[C]. Proceedings of the6th USENIXsymposium on Networked systems design and implementation (NSDI’09),Berkeley, CA, USA,2009:1-14.
[67] F. D. Garcia and J. henk Hoepman. Off-line karma: A decentralized currencyfor peer-to-peer and grid applications[C]. Proceedings of the3rd AppliedCryptography and Network Security conference (ACNS). Springer,2005:364-377.
[68] V. Vishnumurthy, S. Chandrakumar, and E. G. Sirer. Karma: A secureeconomic framework for p2p resource sharing[C]. Proceedings of the2005Conf. of the Centre for Advanced Studies on Collaborative research. IBMPress,2005:185-199.
[69] M. Sirivianos, J. H. Park, X. Yang, and S. Jarecki. Dandelion: Cooperativecontent distribution with robust incentives[C]. Proceding of the2007USENIX Annual Technical Conference,2007:157–170.
[70] T. Locher, S. Schmid, and R. Wattenhofer. Rescuing tit-for-tat with sourcecoding[C]. Proceedings of the7th IEEE International Conferenceon Peer-to-Peer Computing (P2P2007), Galway, Ireland,2007:3–10.
[71] J Pouwelse, P Garbacki, D Epema, H Sips. The Bittorrent P2P file-sharingsystem: Measurements and analysis[C]. Proceedings of the54thInternational Workshop on Peer-to-Peer Systems, Ithaca, USA,2005:205-216.
[72] N. Christin, AS. Weigend, J. Chuang. Content availability, pollution andpoisoning in peer-to-peer file sharing networks[C]. Proceedings of the6thACM Conference on Electronic Commerce (EC’05), Vancouver, BC, Canada,2005:68-77.
[73] Q. Gu, K. Bai, H. Wang, P. Liu, C. H. Chu. Modeling of pollution in p2p filesharing systems[C]. Proceedings of the3rd IEEE Consumer Communicationsand Networking Conference (CCNC2006),2006:1033-1037.
[74] R. Thommes, M. Coates. Epidemiological Modeling of Peer-to-Peer Virusesand Pollution[C]. Proceedings of the25th IEEE International Conference onComputer Communications (INFOCOM’06), Barcelona, Spain,2006:1-12.
[75] U. Lee, M. Choi, J. Cho, M. Y. Sanadidi, M. Gerla. Understanding PollutionDynamics in P2P File Sharing[C]. Proceedings of the5th InternationalWorkshop on Peer-to-Peer Systems (IPTPS’06),2006.
[76] R. Kumar, D. Yao, A. Bagchi, K. W. Ross, D. Rubenstein. Fluid modeling ofpollution proliferation in P2P networks[C]. Proceedings of SIGMET-RICSPerformance evaluation review SESSION,2006:335-346.
[77] C. Shi, D. Y. Han, X. Y. Hu, and Y. Yu. A unified model of pollution in P2Pnetworks[C]. Proceedings of the22nd IEEE International Parallel&Distributed Processing Symposium (IPDPS’08), Miami, Florida, USA,2008:1-12.
[78] J. Liang, N. Naoumov, K. W. Ross. Efficient blacklisting and pollution-levelestimation in P2P file-sharing systems[C]. Proceedings of the first Asianinternet engineering conference on technologies for advancedheterogeneous networks,2005:1-21.
[79] K. Walsh, E. G. Sirer. Fighting Peer-to-Peer SPAM and Decoys with ObjectReputation[C]. Proceedings of SIGCOM-M’05Workshop on Economics ofPeer-to-Peer System. Philadelphia, USA,2005:138-143.
[80] K. G. Dastidar, T. Herman and C. Johnen. Safe peer-to-peer self-downloading[J]. ACM Transactions on Autonomous and Adaptive Systems(TAAS).2008,3(4):1-18.
[81] M. Zuo, Y. H. Ma, R. Chbeir, J. H. Li. Combating P2P File Pollution with Co-alerting[C]. Proceedings of the third international IEEE Conference onSignal-Image Technologies and Internet-Based System (SITIS’07), Shanghai,China,2007:289-297.
[82] R. C. Chen, E. K. Lua, J. Crowcroft, C. Tang, L. Tang and Z. Chen. Phagocytes:A Holistic Defense and Protection Against Active P2P Worms[C]. Proceedingsof the6th USENIX Symposium on Networked Systems Design andImplementation (NSDI’09), Boston, US,2009
[83] Media Defender[M/OL]. http://www.mediadefender.com.
[84] Safenet[M/OL]. http://www.safenet-inc.com.
[85] A. Shamir. Identity-based cryptosystems and signature schemes[C].Proceedings of CRYPTO84on Advances in cryptology, New York, NY, USA,1985:47-53.
[86] J. Newsome, E. Shi, D. X. Song, and A. Perrig. The Sybil attack in sensornetworks: analysis&defenses[C]. Proceedings of the3rd Int’l Symp. OnInformation Processing in Sensor Networks (IPSN’04), Berkeley, USA,2004:259-268.
[87] H. Rowaihy, W. Enck, P. McDaniel, and T. La Porta. Limiting sybil attacks instructured p2p networks[C]. Proceeding of the26th IEEE InternationalConference on Computer Communications (INFOCOM’07).2007:2596-2600.
[88] M. J. Freedman and R. Morris. Tarzan: a peer-to-peer anonymizing networklayer[C]. Proceedings of the9th ACM conference on Computer andcommunications security. New York, NY, USA,2002:193-206.
[89] H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. Sybilguard: defendingagainst sybilattacks via social networks[C]. Proceedings of the2006conference on Applications, technologies, architectures, and protocols forcomputer communications, New York, NY, USA,2006:267-278.
[90] H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. Sybillimit: A near-optimalsocial network defense against sybil attacks[J]. IEEE/ACM Transactions onNetworking (TON),2010,18(3):885-898.
[91] N. Tran, B. Min, J. Li, and L. Subramanian. Sybil-resilient online contentvoting[C]. Proceedings of the6th USENIX symposium on Networked systemsdesign and implementation (NSDI’09), Berkeley, CA, USA,2009:15-28.
[92] S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The eigentrustalgorithm for reputation management in p2p networks[C]. Proceedings ofthe12th international conferenceon World Wide Web (WWW’03), NewYork, NY, USA,2003:640-651.
[93] K. Walsh and E. G. Sirer. Experience with an object reputation system forpeer-to-peer file sharing[C]. Proceedings of the3rd conference onNetworked Systems Design&Implementation (NSDI’06). Berkeley, CA, USA,2006.
[94] C. Costa, V. Soares, J. Almeida, and V. Almeida. Fighting pollutiondissemination in peer-topeer networks[C]. Proceedings of the2007ACMsymposium on Applied computing (SAC’07), New York, NY, USA,2007:1586-1590.
[95] S. Marti and H. Garcia-Molina. Identity crisis: Anonymity vs. reputation inp2p systems[C]. Proceedings of the3rd International Conference on Peer-to-Peer Computing (P2P’03), Washington, DC, USA,2003:134-141.
[96] A. Cheng and E. Friedman. Sybilproof reputation mechanisms[C].Proceedings of the2005ACM SIGCOMM workshop on Economics of peer-to-peer systems (P2PECON’05), New York, NY, USA,2005:128-132.
[97] R. Landa, D. Griffin, R. G. Clegg, E. Mykoniati, and M. Rio. A sybilproofindirect reciprocity mechanism for peer-to-peer networks[C]. Proceedingsof the28th IEEE Conference on Computer Communications (INFOCOM’09),Rio de Janeiro, Brazil,2009:343-351.
[98] H. Yu, C. Shi, M. Kaminsky, P. B. Gibbons, and F. Xiao. Dsybil: Optimal sybil-resistance for recommendation systems[C]. Proceedings of the30th IEEESymposium on Security and Privacy (SP’09), Oakland, California, USA,2009:283-298.
[99] M. Piatek, T. Isdal, A. Krishnamurthy, and T. Anderson. One hop reputationsfor peer to peer file sharing workloads[C]. Proceedings of the5th USENIXSymposium on Networked Systems Design and Implementation (NSDI’08),Berkeley, CA, USA,2008:1-14.
[100] Q. Lian, Y. Peng, M. Yang, Z. Zhang, Y. Dai, and X. Li. Robust incentives viamulti-level titfor-tat: Research articles[J]. Concurrency and Computation:Practice&Experience.2008,20(2):167-178.
[101] J. Falkner, M. Piatek, J. P. John, et al. Profiling a million user DHT[C].Proceedings of the7th ACM SIGCOMM conference on Internetmeasurement (IMC’07), San Diego, CA, USA,2007:129-134.
[102] A. Parker. The true picture of Peer-To-Peer file-sharing[C]. Proceedings ofIEEE10th Int'l Workshop on Web Content Caching and Distribution, SophiaAntipolis, France,2005.
[103] H. Schulze and K. Mochalski, Ipoque. internet study2008/2009.[M/OL].http://www.ipoque.com/study/ipoque-Internet-Study-08-09.pdf
[104] L. Massoulié and M. Vojnovi′c. Coupon Replication Systems[C]. Proceedingsof the2005ACM SIGMETRICS international conference on Measurementand modeling of computer systems (SIGMETRICS’05), Banff, B, Canada,2005:2-13.
[105] P. Dhungel, X. Hei, D. Wu, and K. W. Ross. A measurement studay of attackson bittorrent seeds[C]. Proceedings of IEEE International Conference onCommunications (ICC’2011), Kyoto, Japan,2011:1-5.
[106] K. Shin, D. S. Reeves, and I. Rhee. Treat-before-trick: Free-riding preventionfor bittorrent-like peer-to-peer networks[C]. Proceedings of the2009IEEEInternational Symposium on Parallel&Distributed Processing (IPDPS’09),Rome, Italy,2009:1-12.
[107] M. A. Konrath, M. P. Barcellos, and R. B. Mansilha. Attacking a swarm with aband of liars: evaluating the impact of attacks on bittorrent[C]. Proceedingsof the Seventh IEEE International Conference on Peer-to-Peer Computing(P2P’07), Galway, Ireland,2007:37-44.
[108] J. K. So and D. Reeves. Defending against sybil nodes in bittorrent[C].Proceedings of the10th international IFIP TC6conference on Networking(NETWORKING’11),2011:25-39.
[109] M. P. Barcellos, D. Bauermann, H. Sant’anna, M. Lehmann, R. Mansilha.Protecting BitTorrent: design and evaluation of effective countermeasuresagainst DoS attacks[C]. Proceedings of the27th International Symposium onReliable Distributed Systems (IEEE SRDS2008), Naples,2008:73-82
[110] D. Bertsekas, R. Gallager. Data Networks[M]. Englewood Cliffs, NJ, PrenticeHall,1987.
[111] A. Legout, N. Liogkas, E. Kohler, and L. X. Zhang. Clustering and sharingincentives in BitTorrent systems[C]. Proceedings of the2007ACMSIGMETRICS international conference on Measurement and modeling ofcomputer systems. New York, USA,2007:301312
[112] C. Chan, S. Chan, Distributed Hash Tables: Design and Applications[C].Handbook of Peer-to-Peer Networking. Springer Science,2010:257-280.
[113] G. Urdaneta, G. Pierre, and M. van Steen.A survey of dht securitytechniques[J]. ACM Computing Surveys,2011,43(2): Article No.8.
[114] B. Neil, L. C. Shields, N. B. Margolin. A survey of solutions to the sybilattack[R]. Amherst: University of Massachusetts Amherst,2006.
[115] A. Singh, M. Castro, P. Druschel, and A. Rowstro. Defending against eclipseattacks on overlay networks[C]. Proceedings of the11th workshop on ACMSIGOPS European workshop,2004: Article No.21.
[116] R. Villanueva, M. Villamil and R. Arnedo. Secure routing strategies in DHT-based systems[C]. Proceedings of the third International conference on Datamanagement in grid and peer-to-peer systems. Springer,2010:62-74.
[117] R. Villanueva, M. Villamil. SecureRoutingDHT: A Protocol for ReliableRouting in P2P DHT-based Systems[C].Proceedings of the7th InternationalConference on Internet and Web Applications and Services (ICIW2012),Stuttgart, Germany,2012:260-267.
[118] M Sa nchez-r gas, P Garc a-Lo pez, and Go mez. A novel methodologyfor constructing secure multi-path overlay[J]”, IEEE Internet Computing,2005,9(6):50-57.
[119] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. Wallach. Securerouting for structured peer-to-peer overlay networks[C]. Proceedings of the5th Symposium on Operating Systems Design and Implementation, ACMPress,2002:299-314
[120] C. Harvesf and D. Blough. Replica placement for route diver-sity in tree-based routing distributed hash tables[J]. IEEE Transactions on Dependableand Secure Computing,2009,8(3):419-433.
[121] M. Naor and U. Wieder. A simple Fault Tolerant Distributed Hash Table[C].Proceedings of the2nd Int. Workshop on Peer-to-Peer Systems (IPTPS’03),Springer,2003:88-97.
[122] M. Young, A. Kate, I. Goldberg, and M. Karsten. Prac-tical robustcommunication in DHTs tolerating a byzan-tine adversary[C]. Proceedings ofthe30th Int. Conf. on Distributed Computing Systems,2010:263-272.
[123] M Sa nchez-r gas, P Garc a-Lo pez, and Go mez. By-pass: providingsecure DHT routing through bypassing ma-licious peers[C]. Proceedings ofSymposium on Computers and Communications,2008:934-941.
[124] M. Srivatsa and L. Liu. Vulnerabilities and security threats in structuredoverlay networks: A quantitative analysis[C]. Proceedings of the20thAnnual Computer Security Applications Conference,2004:252-261.
[125] P. Wang, L. Osipkov, N. Hopper, and Y. Kim. Myrmic: secure and robust DHTrouting[M]. Technical report, University of Minnesota-Twin cities,2006.
[126] K. Needels and M. Kwon. Secure routing in peer-to-peer distributed hashtables[C]. Proceedings of the Symposium on Applied Computing, ACM,2009:54-58.
[127] B. Roh, O. Kwon, S. Hong, and J. Kim. The exclusion of malicious routingpeers in structured P2P systems[C]. Proceedings of the5th Int. Workshop onAgents and Peer-to-Peer Computing, Springer,2006:43-50.
[128] S. Marti, P. Ganesan and H. Garcia-Molina. DHT routing using social links[C].Proceedings of the3rd International Workshop on Peer-to-Peer Systems(IPTPS’04), Springer,2004:100-111.
[129] M Sa nchez-r gas and P Garc a-Lo pez. On routing in distributed hashtables: is reputation a shelter from mali-cious behavior and churn?[C].Proceedings of the9th Int. Conf. on Peer-to-Peer Computing,2009:31-40.
[130] M Sa nchez-r gas, P Garc a-Lo pez, and Go mez. Secure forwarding inDHTs-is redundancy the key to robustness?[C]. Proceedings of the14thInternational European Conference on Parallel and Distributed Computing,Springer,2008:611-621.
[131] N. Fedotova, M. Bertucci, and Veltri. Reputation management techniques inDHT-based peer-to-peer networks[C]. Proceedings of the2nd Int. Conf. onInternet and Web Applications and Services, IEEE Press,2007: pp.4
[132] G. Danezis, C. Lesniewski-Laas, M. Kaashoek, and R. Ander-son. Sybil-resistant DHT routing[C]. Proceedings of the10th European Symposium onResearch In Computer Security, Springer,2005:305-318.
[133] M. Castro, P. Druschel, A. Ganesh, A. Rowstron, and D. S. Wallach. Securerouting for structured peer-to-peer overlay networks[C]. Proceedings of the5th symposium on Operating systems design and implementation,2002,36(SI):299-314.
[134] I. Baumgart and S. Mies. S/kademlia: A practicable approach towards securekeybased routing[C]. Proceedings of the2007International Conference onParallel and Distributed Systems, Hsinchu,2007:1-8.
[135] D. Cerri, A. Ghioni, S. Paraboschi, and S. Tiraboschi. ID mapping attacks inp2p networks[C]. Proceedings of the2005IEEE Global TelecommunicationsConference (GLOBECOM2005), St. Louis, MO, USA,2005.
[136] F. Lesueur, L. Me, and V.V.T. Tong. An efficient distributed pki for structuredp2p networks[C]. Proceedings of the9th IEEE Int'l Conference on Peer-to-Peer Computing (P2P’09), Seattle, Washington, USA,2009:1-10.
[137] S. Marti, P. Ganesan, and H. Garcia-Molina. Dht routing using social links[C].Proceedings of the3rd International Workshop on Peer-to-Peer Systems(IPTPS’04),2004:100-111.
[138] W. Galuba, K. Aberer, Z. Despotovic, and W. Kellerer. Authentication-freefault tolerant peer-to-peer service provisioning[C]. Proceedings ofDatabases, Information Systems, and Peer-to-Peer Computing (DBISP2P’07),2007.
[139] Stutzbach and R. Rejaie. Improving Lookup Performance over a Widely-Deployed DHT[C]. Proceedings of the25th IEEE Conference on ComputerCommunications (INFOCOM’06), Barcelona, Spain,20061-12.
[140] S. Ren, L. Guo, S. Jiang and X. Zhang. SAT-Match: A self-adaptive topologymatching method to acheive low lookup latency in structured P2P overlaynetworks[C]. Proceedings of the18th International Parallel and DistributedProcessing Symposium,2004:83-91.
[141] B. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hashtables[C]. Proceedings of the24th Annual Joint Conference of the IEEEComputer and Communications Societies (INFOCOM’05), Miami, USA,2005:596-606.
[142] A. Rao，K. Lakshminaraynan, S. Surana, R. Karp, I. Stoica. Load balancing instructured P2P systems[C]. Proceedings of the2nd International WorkshopPeer-to-Peer systems (IPTPS’03). Berkeley, USA,2003:68-79.
[143] H. C. Hsiao, C. W. Chang, A Symmetric Load Balancing Algorithm withPerformance Guarantees for Distributed Hash Tables[J]. IEEE Transactionson Computers,2012, PP(99):1.
[144]张宇翔，张宏科.一种层次结构化P2P网络中的负载均衡方法[J].计算机学报，2010,33(9):1580-1590.
[145] M. Steiner, W. Effelsberg, T. En-Najjary, and E. W. Biersack. Load reduction inthe KAD peer-to-peer system[C]. Proceeding of the Fifth InternationalWorkshop on Databases, Information Systems and Peer-to-Peer Computing(DBISP2P), Vienna, Austria,2007.
[146] Moritz Steiner, Taoufik En-Najjary, and Ernst W. Biersack. Long Term Studyof Peer Behavior in the KAD DHT[J]. IEEE/ACM Transactions on Networking,2009,17(5):1371-1384.
[147]夏春和,石昀平,李肖坚.结构化对等网中的P2P蠕虫传播模型研究[J].计算机学报,2006,29(6):952-959.
[148] Xiong L, Liu L. PeerTrust: supporting reputationbased trust for Peer-to-Peerelectronic communities[J]. IEEE transaction on knowledge and dataengineering,2004,16(7):843-857.
[149]窦文,王怀民,贾焰,邹鹏.构造基于推荐的Peer-to-Peer环境下的Trust模型[J].软件学报,2004,15(4):571-583.
[150] C. Lesniewski-Laas. A sybil-proof one-hop DHT[C]. Proceedings of the firstWorkshop onSocial Network Systems (SocialNets’08), Glasgow, Scotland, UK,2008:19-24.
[151] Ingmar B, Bernhard H, Stephan K. OverSim: A Flexible Overlay NetworkSimulation Framework[C]. Proceedings of the10th IEEE Global InternetSymposium, Anchorage, AK, USA,2007:79-84.