Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (20): 77-80.

• 网络、通信、安全 • Previous Articles     Next Articles

Polynomial group key management for ad hoc networks

TU Shanshan1,2,MA Chunbo1,AO Faliang1   

  1. 1.School of Information and Communication,Guilin University of Electronic Technology,Guilin,Guangxi 541004,China
    2.Hubei Lightning Protection Center,Wuhan 430074,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-07-11 Published:2011-07-11

ad hoc网络中多项式组密钥管理方案

涂山山1,2,马春波1,敖发良1   

  1. 1.桂林电子科技大学 信息与通信学院,广西 桂林 541004
    2.湖北省防雷中心,武汉 430074

Abstract: In ad hoc networks,nodes have dynamic topological structure and limited computational and memory resources.This paper adapts existing work on STR by symmetric key operations and polynomial evaluations,thereby reducing the code space and computation substantially.This scheme also discusses the relationship of establishment for nodes when structure changes,so that security and efficiency can be unified.

Key words: group key management, symmetric polynomials, tree structure, ad hoc networks, security and efficiency

摘要: 在ad hoc网络中,节点存在拓扑结构动态变化以及存储和计算能力相对低下等特点。提出了基于STR树状结构的组密钥管理方案,利用对称密码学原理以及对多项式赋值的运算方式,有效地降低了每个节点所需存贮的空间以及运算量,使该类型的树状结构适用于ad hoc网络。同时,该密钥管理方案也考虑到了当成员发生变化时的各种情况,使其在安全性与高效性上达到统一。

关键词: 组密钥管理, 对称多项式, 树状结构, ad hoc网络, 安全高效