基于集对分析的P2P网络安全中的信誉度改进算法  

A Modified Security Solution Based on SPA for Servents' Reputations in P2P Systems

作　　者：胡波[1] 王汝传[1] 王海艳[1] 

机构地区：[1]南京邮电大学计算机学院,江苏南京210003

出　　处：《电子学报》2007年第2期244-247,共4页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60573141;No.70271050);江苏省自然科学基金(No.BK2005146);江苏省高技术研究计划(BG2004004;No.BG2005037;No.BG2005038;No.BG2006001);国家863高科技研究计划(No.2006AA01z201;No.200601z219;No.2006AA01z439);南京市高科技项目(No.2006软资105);江苏省计算机信息处理技术重点实验室基金(No.kjs050001;No.kjs06006);江苏省高校自然科学研究计划(No.05KJB520092)

摘　　要：P2P安全是P2P技术中的关键问题.传统基于信誉度的投票选举方法能够很好地反映P2P网络中未知节点的表现,为该节点的可信度提供可靠依据,但该方法并未将P2P网络中的不确定因素考虑进去.集对分析理论是一种研究不确定性问题的数学方法.本文提出了一种基于节点的不确定性的P2P网络信誉度安全机制,并采用集对分析方法对信誉度进行了定量分析.最后对两种算法做了对比分析,指出了改进算法的优越性.The security is a key problem in P2P network. A proposed reputation-polling protocol could resolve it by reflecting the credibility with the former performances of unknown servents. Unfortunately, it didn＇ t take account of the uncertainty in P2P systems. SPA is a new way about dealing with uncertainties problems. We proposed a security solution which was based on servents＇ uncertainties, and took quantitative analysis with SPA for servents＇ reputation. In the end, a comparison was made to testify the solution＇ s superiority.

关 键 词：P2P网络 安全机制 信誉度 集对分析 

分 类 号：TP309.2[自动化与计算机技术—计算机系统结构]