On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks
| dc.creator | Martin, Keith M. | |
| dc.date | 2009-02-03 | |
| dc.date.accessioned | 2026-07-07T12:37:17Z | |
| dc.date.available | 2026-07-07T12:37:17Z | |
| dc.description | 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 designs. We review and examine the appropriateness of combinatorial designs as a tool for building key predistribution schemes suitable for such environments. | |
| dc.identifier | https://arxiv.org/abs/0902.0458 | |
| dc.identifier | http://arxiv.org/abs/0902.0458 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/218384 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Discrete Mathematics | |
| dc.subject | E.3; G.2.1; C.2.1 | |
| dc.title | On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks | |
| dc.type | text |