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
The search for a finite projective plane of order 10
American Mathematical Monthly
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE 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
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
Proceedings of the 3rd international conference on Mobile systems, applications, and services
Deterministic key predistribution schemes for distributed sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
Clique size in sensor networks with key pre-distribution based on transversal design
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
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
A hybrid design of key pre-distribution scheme for wireless sensor networks
ICISS'05 Proceedings of the First international conference on Information Systems Security
On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Connecting, scaling and securing RS code and TD based KPDs in WSNs: deterministic merging
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.00 |
Combinatorial designs are very effective tools for managing keys in an infrastructure where power and memory are two major constraints. None of the present day wireless technologies takes the advantage of combinatorial designs. In this paper, we have proposed a general framework using combinatorial designs which will enable the participating devices to communicate securely among themselves with little memory and power overhead. The scheme caters for different kinds of user requirements and allows the designer to choose different combinatorial designs for different parts or levels of the network. This general framework will find application in all wireless radio technologies, typically WPANs and WLANs. This is a hitherto unexplored technique in wireless technologies.