大规模Ad hoc网络中一种高效的组密钥协商协议  

Efficient group key agreement protocol for large Ad hoc networks

作　　者：章丽平[1] 崔国华[1] 

机构地区：[1]华中科技大学计算机学院

出　　处：《计算机应用研究》2008年第6期1817-1821,1824,共6页Application Research of Computers

基　　金：国家自然科学基金资助项目(60403027);中国地质大学(武汉)优秀青年教师计划资助项目(CUGQNL0836)

摘　　要：移动Ad hoc网络自身的特点决定了该网络中节点资源的有限性,所以在移动Ad hoc网络中构建组密钥协商协议时,应尽量减少节点的资源开销。为了解决这个问题,提出了一种基于分簇-K叉树组模型结构的组密钥协商协议——CKT-ECC协议。该协议在分簇-K叉树组模型结构上,采用椭圆曲线密码体制实施密钥协商和分配,使得节点在密钥协商过程中具有低计算开销和低通信开销的优势。与GDH、TGDH组密钥协商协议相比,本协议有效地降低了节点在密钥协商过程中的计算开销和通信开销,适用于大规模移动Ad hoc网络。Mobile Ad hoc networks is a new-style mobile multihop wireless networks.Resource of the nodes in Ad hoc networks is limited.So the costs of the nodes resource should be minimized whenever constructing the group key agreement protocol in the Ad hoc networks.To solve this problem,this paper proposed a security efficient group key agreement protocol based on a cluster-K-tree structure referred as CKT-ECC.In the CKT-ECC protocol the elliptic curve cryptosystem was employed on clusterK-tree structure to establish and allocate group key.So the protocol had some advantages that were the cost of computation and communication on node in key agreement process was low.Finally,compared the proposed protocol with TGDH and GDH group key agreement protocols,the analysis results showed that the protocol decreased both the computational overhead and communication costs and adapted to the large mobile Ad hoc networks.

关 键 词：AD HOC网络 组密钥协商 椭圆曲线 簇 K叉树 

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