可再生Hash链对SEAD协议的安全性改进  

Security Improvements for Secure Routing Protocol SEAD Using Re-Generative Hash Key Chain

作　　者：黄海平[1,2,3] 吴万烽[1,2] 王汝传[1,2,3] 李玲娟[1] 

机构地区：[1]南京邮电大学计算机学院,南京210003 [2]江苏省无线传感网高技术研究重点实验室,南京210003 [3]江苏省计算机信息处理技术重点实验室(苏州大学),江苏苏州215006

出　　处：《北京邮电大学学报》2013年第4期99-103,共5页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61003039;61170065;61201163);江苏科技支撑(工业)计划项目(BE2012183);博士后基金项目(2012M511753;1101011B);苏州大学计算机信息处理技术重点实验室基金项目(KJS1022)

摘　　要：采用可再生散列(Hash)密钥链机制增强无线自组织(Ad hoc)网络中安全有效距离矢量路由SEAD协议的安全性.基于(t,n)门限方案,设计了一种新型的可再生Hash密钥链算法,每当发布当前链的一个Hash值,同时发布一个生成下一条Hash链所需要的子公钥;当Hash值发布t次以后,各验证节点能利用先前收集的各子公钥来验证新产生Hash链的链尾值数字签名的有效性,从而使得新链能正确使用,继续保障路由协议的可靠性.利用NS-2平台进行了仿真实验,并与赵源超等提出的2种Hash链可再生方案进行了性能比较.实验结果表明,所提方案具有更好的安全性,在cbr数据包发送率方面具有更高的成功率,并且在能效上也有一定改进.The regenerative Hash key chain mechanism is adopted for the secure routing protocol named as secure efficient distance vector routing （SEAD） in Ad hoc networks in order to enhance the security performance. Based on （t, n）-threshold scheme, a new regenerative Hash chain method is designed, in which as the sender sends one key value of the current Hash chain, and then it sends a shadow of public key of the new Hash chain as following. This method effectively verifies the signature of the tail value of the new Hash chain after receiving total t key values of the old Hash chain and simultaneously makes the new Hash chain to be used correctly continuing to ensure the routing protocol＇ s security and reliability. Compared with the two methods proposed by Zhao Yuanchao, NS-2 simulation shows that the method has higher security and success rate on transmission of cbr packets, makes some improvements on energy con- sumption at the same time.

关 键 词：无线自组织网络 散列链再生 安全路由协议 （t n）门限方案 

分 类 号：TN929.53[电子电信—通信与信息系统]