一种新的基于椭圆曲线密码体制的Ad hoc组密钥管理方案  

A New Ad hoc Group Key Agreement Scheme Based on ECC

作　　者：冯涛[1,2] 王毅琳[1] 马建峰[2] 

机构地区：[1]兰州理工大学计算机与通信学院,甘肃兰州730050 [2]西安电子科技大学计算机网络与信息安全教育部重点实验室,陕西西安710071

出　　处：《电子学报》2009年第5期918-924,共7页Acta Electronica Sinica

基　　金：国家自然科学基金(No.60573036,No.60743005,No.60702059,No.60503012);国家863高技术研究发展计划(No.2007AA01Z405,No.2007AA01Z429);甘肃省自然科学基金(No.2007GS04823,No.2007GS04066)

摘　　要：在安全的组通信中,组密钥管理是最关键的问题.论文首先分析了组密钥管理的现状和存在的问题,然后基于椭圆曲线密码体制,针对Ad hoc网络提出了一种安全有效的分布式组密钥管理方案,并对其正确性和安全性进行了证明,由椭圆曲线离散对数困难问题保证协议的安全.针对Ad hoc网络节点随时加入或退出组的特点,提出了有效的组密钥更新方案,实现了组密钥的前向保密与后向保密.与其他组密钥管理方案相比,本方案更加注重组成员的公平性,没有固定的成员结构,并且还具有轮数少、存储开销、通信开销小等特点,适合于在Ad hoc网络环境中使用.In secure group communication, group key management is the most critical issue. Firstly, we analyze the state and the problem of existing group key management schemes, and then present a secure, efficient and contributory group key nl^gement scheme based on elliptic curve cryptosystems. The security, correctness and completeness of our scheme are discussed in this paper. The security of our scheme relies on the elliptic curve discrete logarithm problem（ECDLP）. For the sake of the forward secrecy and backward secrecy of group key, new scheme supports group members to renew their group key when the external nodes join the group or the internal members leave the group. Compared with the known approaches, new scheme attaches more importance to impartiality, the group structure is unfixed, all participants only need two-rounds to generate the group key, the low memory cost is also the virtue of our scheme. The new scheme is suitable for application in Ad hoc network environment.

关 键 词：组密钥管理 椭圆曲线 离散对数 前向保密 后向保密 

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