A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Tamper resistance: a cautionary note
WOEC'96 Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2
An efficient key pre-distribution scheme for secure distributed sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Energy-Driven adaptive clustering hierarchy (EDACH) for wireless sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
IEEE Communications Magazine
Hi-index | 0.00 |
Key distribution is one of the most challenging issues for secure communication in wireless sensor networks. Even though the random key predistribution approach is suitable for sensor nodes of low power and resource, a shared key between a pair of nodes is not guaranteed to be found and thus they cannot communicate with each other. This paper proposes a new robust key pre-distribution scheme solving this problem while security is not compromised even though the data exchanged between the nodes are tapped by an adversary. This is achieved by using the keys assigned through LDU decomposition of the symmetric matrix of a pool of keys. A general form solution of L, D, and U matrix is also developed to minimize the time overhead of LDU decomposition. Computer simulation reveals that the proposed scheme also significantly improves the energy efficiency compared with the existing random key predistribution scheme.