|
|
|
| Key Predistribution Scheme Based on CRT and LU Matrix for Wireless Sensor Networks |
| ZHOU 南Run-1, 2 , JIANG Qiong-Xi-1, GONG Li-Hua-1 |
| (1. Deptartment of Electronic Information Engineering, Nanchang University, Nanchang 330031, China; 2. Shanghai Key Laboratory of Integrate Administration Technologies for Information Security, School of Information Security Engineering, Shanghai Jiaotong University, Shanghai 200240, China) |
|
|
|
|
Abstract Aiming at the shortages of connectivity, resistance and node overheads among traditional key predistribution schemes for heterogeneous sensor networks, a key predistribution scheme combining the Chinese remainder theorem (CRT) with LU matrix was proposed. The CRT is used to secure the communication keys between cluster head and its cluster members. The communication keys among cluster heads or between cluster head and base station are generated with LU matrix. The problems that the communication key in any cluster using CRT is sole and that the required overheads is too large using LU matrix are solved. It is shown that node addition and revocation are feasible in the proposed scheme. When the cluster member is added and revoked, the presented scheme is supported with backwardsecurity and forward-security, respectively. Compared with several typical schemes, the perfect connectivity is given with one key storage unit required for the whole overheads of the cluster member and small overheads for the cluster head and the perfect resistance of networks is guaranteed.
|
|
Received: 11 January 2012
Published: 30 November 2012
|
|
|
|
|
|
| No related articles found! |
|
|
|
|
