检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科技大学计算机学院 [2]现代通信国家重点实验室,四川成都610041
出 处:《计算机工程与科学》2008年第1期32-34,118,共4页Computer Engineering & Science
基 金:国家863计划资助项目(2005AA121570);现代通信国家重点实验室基金资助项目(51436050605KG0102)
摘 要:相对于传统有线网络集中化组密钥管理协议和算法,门限秘密共享技术能很好地适应移动自组网(MANET)的特点,提供高效可靠的安全保证。为了防止退出节点合谋重构组私钥威胁组通信安全,安全高效的组密钥更新算法是关键。在对合谋问题进行深入分析的基础上,本文提出了基于邻居节点权值的可验证的组密钥更新算法。该算法在保持组私钥不变的情况下主动更新组成员的私钥份额,有效地解决了节点合谋、更新通信量大、恶意节点参与更新等问题。The threshold secret sharing technology is more adaptable to mobile ad hoc networks(MANET) than the centralized group key management protocol and algorithms in traditional wired networks. It provides efficient and reliable security guarantees for MANET. A secure and efficient group rekeying algorithrn 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 NW'VGRA is proposed which is based on a deep analysis of member collusion behaviors. 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.
关 键 词:移动自组网络 组密钥更新 秘密共享 门限秘密共享
分 类 号:TP393.08[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222