Key Distribution and Node Revocation Schemes for Wireless Sensor Networks

• Main Authors: Tun-Hao Chao, 趙惇豪
• Other Authors: Po-Jen Chuang
• Format: Others
• Language: zh-TW
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/23337205738006369579

碩士 === 淡江大學 === 電機工程學系碩士班 === 93 === 　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.