On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

@inproceedings{Martin2009OnTA,
  title={On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks},
  author={Keith M. Martin},
  booktitle={IWCC},
  year={2009}
}
  • K. Martin
  • Published in IWCC 3 February 2009
  • Computer Science, Mathematics
The constraints of lightweight distributed computing environments such as wireless sensor networks lend themselves to the use of symmetric cryptography to provide security services. The lack of central infrastructure after deployment of such networks requires the necessary symmetric keys to be predistributed to participating nodes. The rich mathematical structure of combinatorial designs has resulted in the proposal of several key predistribution schemes for wireless sensor networks based on… 
Key Predistribution Schemes in Distributed Wireless Sensor Network using Combinatorial Designs Revisited
TLDR
This work studies various deterministic key predistribution techniques that are based on combinatorial design and determines the way keys are drawn from the key pool for distributing to individual sensor nodes.
Deterministic Merging of Blocks in Combinatorial Design based Key Predistribution in Distributed Wireless Sensor Network
TLDR
This work has studied the orthogonal array based key predistribution scheme in detail and the non suitability of merging approach to improve its performance has been shown, and a key establishment algorithm for transversal design based key Predistribution Scheme has been proposed.
Key predistribution for homogeneous wireless sensor networks with group deployment of nodes
TLDR
A flexible scheme is proposed, based on the structure of a resolvable transversal design, that permits effective trade-offs between resilience, connectivity and storage requirements within a group-deployed environment.
Secure Protocols for Key Pre-distribution, Network Discovery, and Aggregation in Wireless Sensor Networks
TLDR
This thesis is concerned with security during all phases of a sensor network’s lifetime: pre-deployment, deployment, operation, and maintenance and presents a family of secure aggregation protocols that allow for data to be efficiently collected from the entire network at a much lower cost than collecting readings individually, even if an active adversary is present.
Key Predistribution in Wireless Sensor Networks When Sensors Are Within Communication Range
TLDR
This chapter describes different types of key predistribution schemes for single-hop networks and discusses their merits and demerits in terms of resiliency, scalability, connectivity, and memory, computation, and communication resources.
Key Predistribution Schemes for Distributed Sensor Networks
TLDR
This paper proposes a new construction method for key predistribution schemes based on combinations of duals of standard block designs which works for any intersection threshold and obtains explicit algebraic expressions for the metrics for local connectivity and resiliency.
Key predistribution schemes for distributed sensor networks via block designs
TLDR
This paper proposes a new construction method for key predistribution schemes based on combinations of duals of standard block designs which works for any intersection threshold and obtains explicit algebraic expressions for the metrics for local connectivity and resiliency.
Redundancy in Key Management for WSNs
TLDR
This paper investigates the opportunity of reducing the storage overhead by distributing the same set of keys to more than one node, and shows that the use of redundancy decreases the level of resilience, but it scales well on very large networks.
...
...

References

SHOWING 1-10 OF 37 REFERENCES
Combinatorial Structures for Design of Wireless Sensor Networks
TLDR
A general framework using combinatorial designs which will enable the participating devices to communicate securely among themselves with little memory and power overhead is proposed.
On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs
TLDR
It is shown that the performance of a KPS can be improved by carefully choosing a certain class of set systems as “key ring spaces”, and two types of transversal designs are employed, which turn out to have significant efficiency in a shared-key discovery phase without degrading connectivity and resiliency.
Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks
TLDR
Novel deterministic and hybrid approaches based on Combinatorial Design are presented for deciding how many and which keys to assign to each key-chain before the sensor network deployment to obtain efficient key distribution schemes.
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks
TLDR
This paper describes how Costas arrays can be used for key predistribution in wireless sensor networks, then defines distinct difference configurations, a more general structure that provides a flexible choice of parameters in such schemes.
Key predistribution for homogeneous wireless sensor networks with group deployment of nodes
TLDR
A flexible scheme is proposed, based on the structure of a resolvable transversal design, that permits effective trade-offs between resilience, connectivity and storage requirements within a group-deployed environment.
Key distribution mechanisms for wireless sensor networks : a survey
TLDR
This work evaluates deterministic, probabilistic and hybrid type of key pre-distribution and dynamic key generation algorithms for distributing pair-wise, group-wise and network-wise keys in distributed and hierarchical wireless sensor networks.
Key Predistribution Using Partially Balanced Designs in Wireless Sensor Networks
TLDR
This work proposes two deterministic key predistribution schemes in a Wireless Sensor Network (WSN), in which sensor nodes are deployed randomly, and shows that the designs give better results than the existing ones.
Random key predistribution schemes for sensor networks
TLDR
The random-pairwise keys scheme is presented, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation.
Product Construction of Key Distribution Schemes for Sensor Networks
TLDR
This paper formularize and analyze key distribution schemes for sensor networks, and deduce general conditions for a scheme to be optimal in terms of connectivity, resilience and memory usage, and proposed 2 schemes that can achieve optimal connectivity and resilience with the restriction of memory space.
Deterministic Key Predistribution Schemes for Distributed Sensor Networks
TLDR
This paper presents two key predistribution schemes (KPSs) for DSNs, ID-based one-way function scheme (IOS) and deterministic multiple space Blom's scheme (DMBS), which are deterministic, while most existing schemes are based on randomized approach.
...
...