An optimal class of symmetric key generation systems
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
Combinatorics of experimental design
Combinatorics of experimental design
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
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
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Combinatorial Designs: Constructions and Analysis
Combinatorial Designs: Constructions and Analysis
Deterministic key predistribution schemes for distributed sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design
ISC'05 Proceedings of the 8th international conference on Information Security
An Application-Oriented Framework for Wireless Sensor Network Key Establishment
Electronic Notes in Theoretical Computer Science (ENTCS)
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Clique size in sensor networks with key pre-distribution based on transversal design
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Combinatorial structures for design of wireless sensor networks
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
Here a scheme is presented for key pre-distribution in wireless sensor networks. A transversal design is considered to construct a (v, b, r, k) configuration. Then properly chosen blocks are merged to form sensor nodes such that there is no intra-node common key. The choice of blocks in merging is currently made heuristically in a randomized manner. The scheme is called hybrid as a combinatorial design followed by a heuristic is applied. Detailed analysis is presented regarding the number of nodes, number of keys per nodes and the probability that a link gets affected if certain number of nodes are compromised. It is also argued how the scheme compares favourably with the state of the art proposals. Towards the end we also present a result to find out the lower bound on the number of nodes given a certain combinatorial design.