检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]江南大学信息工程学院,江苏无锡214122 [2]南京邮电大学计算机学院,南京210003
出 处:《计算机工程与应用》2010年第35期109-111,118,共4页Computer Engineering and Applications
摘 要:P2P和SIP融合技术已经普遍应用于多媒体通信中,它解决了传统的SIP网络单点失效的问题。但是由于现有的P2P-SIP缺少有效的认证方案,给其带来很多安全隐患。现有的P2P-SIP网络的认证方案大多采用节点的真实ID,不能满足其匿名性的特殊要求。针对这个问题,提出了一种基于Diffie-Hellman算法的节点匿名认证方案DHB,该方案初始化阶段使用代理ID分发中心PIAC产生节点的假名。认证阶段采用改进的Diffie-Hellman算法和节点共享信息进行身份认证,实现了P2P-SIP中节点间的匿名认证。理论和实验分析表明,DHB可以有效抵御中间人攻击和猜测攻击,是一种安全有效的节点匿名认证方案。The integration of P2P and SIP is widely used in multimedia communication,which can resolve the problem of single-point failure in traditional SIP based network.Neverthelessl,ots of security problems appear because of the lack of ef-fective authentication.Most present P2P-SIP system authentications try to adopt peers’real ID,which can not meet the de-mand of anonymity of peers.In this paper,an anonymous authentication policy named as DHB based on Diffie-Hellman algo-rithm is proposed to cope with this problem.At the initialization stage of algorithm,DHB uses PIAC to generate peers’ pseudonymous name.At the authentication stage,peers’shared information and improved Diffie-Hellman algorithm are used to make certification between peers.The theoretical and experimental analysis shows that DHB is safe and effective,which can resist man-in-middle attack and key guessing attack.
分 类 号:TP39[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.20.233.31