An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Efficient self-healing group key distribution with revocation capability
Proceedings of the 10th ACM conference on Computer and communications security
Revisiting random key pre-distribution schemes for wireless sensor networks
Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks
Establishing pairwise keys in distributed sensor networks
ACM Transactions on Information and System Security (TISSEC)
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
Combinatorial design of key distribution mechanisms for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
On grid-based key pre-distribution: toward a better connectivity in wireless sensor network
PAKDD'07 Proceedings of the 2007 international conference on Emerging technologies in knowledge discovery and data mining
Hierarchical grid-based pairwise key predistribution scheme for wireless sensor networks
EWSN'06 Proceedings of the Third European conference on Wireless Sensor Networks
Hi-index | 0.00 |
Key pre-distribution in wireless sensor network is aimed at delivering keys to sensor networks at the low expense of computation, communication, and memory while providing a high degree of security expressed by network resiliency to node capture. In this paper, we introduce a computationally efficient construction for the symmetric matrix-based key distribution. Particularly, this work introduces an original modification over the well known DDHV scheme (by Du et al.). Our modification shows that using a specific structures for the public matrix instead of fully random matrix with elements in *** q can reduce the computation overhead for generating the key information and the key itself at the expense of small memory overhead. Our modification guarantees the same level of security for restricted network size. We show an extensive security analysis of the provided scheme in different settings and compare to the relevant works in the literature to demonstrate its merit.