基于访问多项式的互助修复密钥分配方案  

Mutual-healing Key Distribution Scheme Based on Access Polynomial

作　　者：徐帅文[1] 王晓明[1] 

机构地区：[1]暨南大学计算机科学系,广州510632

出　　处：《计算机工程》2012年第16期124-126,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(61070164);广东省自然科学基金资助项目(8151063201000022);广东省科技计划基金资助项目(2010B010600025)

摘　　要：针对自修复密钥分配方案无法恢复前面多次和最后一次会话密钥的不足,提出一个基于访问多项式且适用于移动Ad Hoc网络的互助修复密钥分配方案。该方案采用访问多项式、双向哈希链等技术,在具有多次密钥自修复的同时利用邻居节点来达到互助修复的目的。性能分析结果表明,该方案可以有效保证会话密钥的前向安全和后向安全,同时抵抗任意数量节点的合谋攻击。Aiming at the problem that the self-healing scheme can not recover the more than once previous session keys and the last key, this paper proposes a new mutual-healing key distribution scheme based on access polynomial for mobile Ad Hoc network. The proposed scheme adopts access polynomial and dual directional chains technologies to provide self-healing and mutual-healing through the neighbour nodes. The performance analysis result shows that the proposed scheme achieves forward security, backward security and the resistance to the coalition of any size.

关 键 词：密钥分配 移动AD HOC网络 自修复 互助修复 访问多项式 双向哈希链 

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