MANET中基于邻居节点权值的可验证组密钥更新算法.pdfVIP

CN43-1258/T P 2008 30 1 ISSN 1007-130X COMPUTER ENGINEERING SCIENCE Vol30,No1, 2008 : 1007-130X(2008)01-0032-03 * M NET Neighbor-Weight-Based Verifiable Group Rekeying lgorithm in M NET 1,2 1 3 1 , , , 1, 2 1 3 1 ZHAO Jian- qiang , ZHU Pe-i dong , YANG Ming , HE Jun ( 1 , 410073;2 , 7100 8; 3 , 10041) (1School of Computer Science, National University of Defense Technology, Changsha 410073; 2Xi an Politics Institute, Xi an 7100 8;3National Modern Communication Laboratory, Chengdu 10041, China) :相对于传统有线网络集中化组密钥管理协议和算法, 门限秘密共享技术能很 地适应移动自组网(M NET) 的特点,提供高效可靠的安全保证为了防止退出节点合谋重构组私钥威胁组通信安全, 安全高效的组密钥更新算法是关 键在对合谋问题进行深入分析的基础上, 本文提出了基于邻居节点权值的可验证的组密钥更新算法该算法在保持组 私钥不变的情况下主动更新组成员的私钥份额, 有效地解决了节点合谋更新通信量大恶意节点参与更新等问题 Abstract:T he threshold secret sharing technology is more adaptable to mobile ad hoc networks( M NET) than the cen- tralized group key management protocol and algorithms in traditional wired networks. It provides efficient and reliable secu- rity guarantees for M NET. secure and efficient group rekeying algorithm is very important to prevent the members who have left the group from colluding to reconstruct the group key, which is a threat to the security of group communications.In this paper, a rekeying algorithm named NWVGR is proposed which is based on a deep analysis of member collusion behav- iors. The algorithm renews proactively the key share of members while maintaining an unchanged group key, defeats mem- ber collusion attacks,reduces the rekeying traffic,and restricts malicious members involved in rekeying. :移动自组网络; 组密钥更新;秘密共