無線感測網路中金鑰分發及節點撤銷機制之探討

Key Distribution and Node Revocation Schemes for Wireless Sensor Networks

趙惇豪(Tun-Hao Chao)

指導教授 ： 莊博任

淡江大學/工學院/電機工程學系碩士班/碩士(2005年)

https://doi.org/10.6846/TKU.2005.00582

摘要

無線感測網路是由一群低成本的微型感測器所組成的無線通訊網路，它們可能散佈在某特定區域進行感測資料收集的任務。在無線感測網路中有關安全的議題愈來愈受到重視，而金鑰分發則是影響了訊息加密與認證等安全機制能否正常運作的基本前提。本論文提出了一個具有可擴充性、群組式之隨機金鑰分發機制，它將所有節點分為多個群組並利用單向函數來產生群組對群組的金鑰，以提高金鑰之連結性與最大支援節點數。在效能評估上，我們分析出在目前所有基於隨機預先分發的金鑰機制中，本機制能夠提供最大支援的節點數，而在安全性方面模擬結果也顯示此機制對於入侵節點之攻擊有著良好的抵禦能力。
　　除此之外，為了降低已遭入侵之節點對網路的不良影響，本論文也提出了一個分散式節點撤銷機制，此機制採用了投票的方式，對已遭入侵之節點進行撤銷的動作，並且利用Threshold Secret Sharing的概念來降低記憶體空間成本。

關鍵字

分散式感測網路 ； 金鑰管理 ； 隨機預先分發金鑰機制 ； 節點撤銷

並列摘要

The security issue in distributed sensor networks (DSNs) has been drawing considerable research attention in recent years. Key management, a basic security service, becomes the core design for various security services like encryption and authentication. This thesis presents a Scalable Grouping (SG) random key predistribution scheme which divides all nodes into several groups and uses the one-way function to generate group-to-group pairwise keys to increase the connectivity of each key and to enlarge the maximum supportable network size. Experimental results show that the SG scheme is able to yield more enhanced resilience against node capture in large-scale networks, generate higher scalability than existing random key based schemes, and limit global payoff from local compromised nodes.
　Besides, in order to reduce the effect from compromised nodes, we also propose a distributed node revocation scheme based on the SG scheme. It can revoke the existing compromised node by voting and adopt the concept of Threshold Secret Sharing to reduce the memory cost.

並列關鍵字

Distributed Sensor Networks (DSNs) ； key management ； random key predistribution scheme ； node revocation

參考文獻

[4] L. Eschenauer and V. D. Gligor, “A key-Management Scheme for Distributed Sensor Networks,” Proc. 9th ACM Conference on Computer and Communication Security, Nov. 2002, pp. 41-47.

[5] S. Y. Wu and S. P. Shieh, “Adaptive Random Key Distribution Schemes for Wireless Sensor Networks,” Proc. 2003 International Workshop on Advanced Developments in Software and Systems Security, Dec. 2003.

[7] H. Chan, A. Perrig, and D. Song, “Random Key Predistribution Schemes for Sensor Networks,” Proc. IEEE Symposium on Research in Security and Privacy, May 2003, pp. 197-213.

[8] J. Spencer, The Strange Logic of Random Graphs, Algorithms and Combinatorics.22, Springer-Verlag, 2000.

[11] S. Zhu, S. Xu, S. Setia, and S. Jajodia, “Establishing pairwise keys for secure communication in ad hoc networks: a probabilistic approach,” Proc. 11th IEEE International Conference on Network Protocols (ICNP ’03), Nov. 2003, pp. 326-335.