New pairwise key predistribution scheme for wireless sensor networks
-
摘要: 提出了一种新的基于超立方体和多项式的对偶密钥预分配方案,此方案以超立方体的维度和传感器节点编码的汉明距离为参数.方案具有如下特性:当任意两个邻居传感器节点间的汉明距离小于预先设定的门限值时,可以直接建立对偶密钥.该方案的创新在于将传感器节点间的汉明距离参数化,解决了以往方案只能在汉明距离为1时才能直接建立对偶密钥的限制,经过安全和性能的分析说明,当汉明距离门限值增大时,方案通过牺牲抗节点俘获能力可以提高直接对偶密钥建立概率,从而节省了对于传感器网络来说十分重要的能量消耗.
-
关键词:
- 对偶密钥建立 /
- 传感器网络 /
- 基于超立方体密钥预分配 /
- 多项式 /
- 汉明距离
Abstract: A new hypercube-based key predistribution scheme for establishing pairwise keys between sensor nodes using polynomials, which is parameterized by the dimension of hypercube and the Hamming distance threshold variables was developed. This scheme exhibits a nice property: when the Hamming distance between any two neighboring sensor nodes is less than the pre-defined threshold, the pairwise key can be established directly. The scheme is typical for the innovation that the Hamming distance threshold is parameterized which solves the constraint in previous schemes that any two neighboring nodes can establish pairwise key only when the Hamming distance is one. Extensive performance and security analysis shows that by increasing Hamming distance threshold value, the resilience against node capture attack for higher probability of direct pairwise key establishment can be traded off, so as to save the energy consumption which is the most important issue for sensor networks. -
[1] Akyildiz F, Su W, Sankarasubramaniam Y, et al. A survey on sensor networks[J]. IEEE Communications Magazine, 2002, 40(8):102-114 [2] Diffie W, Hellman M E. New directions in cryptography[J]. IEEE Transactions on Information Theory, 1976, 22:644-654 [3] Rivest R L, Shamir A, Adleman L M. A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 1978, 21(2):120-126 [4] Needham Roger M, Schroeder M D. Using encryption for authentication in large networks of computers[J]. Communications of the ACM, 1978, 21(12): 993-999 [5] Perrig A, Szewczyk R, Wen V, et al. SPINS: security protocols for sensor networks[J]. Wireless Networks, 2002, 8: 521-534 [6] Bundo C, Santis A D, Herzberg A, et al. Perfectly-secure key distribution for dynamic conferences [J]. Information and Computation,1998,146(1):1-23 [7] Liu D, Ning P. Establishing pairwise keys in distributed sensor networks //Proceedings of the 10th ACM Conference on Computer and Communication Security.New York:ACM,2003 [8] Liu D, Ning P. Establishing pairwise keys in distributed sensor networks[J]. ACM Transaction Information Systems, 2005, 1:41-77 -
点击查看大图
计量
- 文章访问数: 3271
- HTML全文浏览量: 35
- PDF下载量: 960
- 被引次数: 0
下载:
