作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (10): 1-3,43. doi: 10.3969/j.issn.1000-3428.2007.10.001

• 博士论文 •    下一篇

基于层次超立方体模型的对偶密钥预置算法

王 雷1,2,陈治平1,2   

  1. (1. 福建工程学院计算机与信息科学系,福州 350014;2. 清华大学计算机科学与技术系,北京 100084)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-05-20 发布日期:2007-05-20

Pairwise Key Predistribution Algorithm          Based on Hierarchical Hypercube Model

WANG Lei1,2, CHEN Zhiping1,2   

  1. (1. Department of Computer and Information Science, Fujian University of Technology, Fuzhou 350014; 2. Department of Computer Science & Technology, Tsinghua University, Beijing 100084)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-05-20 Published:2007-05-20

摘要: 通过所建立对偶密钥,传感器网络节点之间可使用加密技术进行通信,从而保障了通信的安全性。在KDC和基于多项式池的密钥预置模型基础上,提出了一种用于密钥预置的层次超立方体模型及其密钥预置算法。理论与实验分析表明,与基于多项式和基于多项式池的对偶密钥预置算法相比,该算法具有更好的安全性能与更高的对偶密钥建立概率。

关键词: 对偶密钥, 传感器网络, 密钥池, 密钥预置, H2模型

Abstract: Security schemes of pairwise key establishment, which enable sensors to communicate with each other securely, play a fundamental role in research on security issue in wireless sensor networks. A general framework for key predistribution named H2 (Hierarchical Hypercube) is presented, based on the idea of key distribution center and polynomial pool schemes. Theoretic analysis and experimental figures show that the new algorithm has better security performance and provides higher possibilities for sensors to establish pairwise key, compared with previous related works such as polynomial and polynomial pool-based pairwise key predistribution algorithms.

Key words: Pairwise key, Sensor networks, Key pool, Key predistribution, H2 model

中图分类号: