Use this URL to cite or link to this record in EThOS:
Title: Combinatorial aspects of key predistribution for resource-constrained networks
Author: Kendall, Michelle Louise
Awarding Body: University of London
Current Institution: University of London
Date of Award: 2013
Availability of Full Text:
Access from EThOS:
To secure a network of small devices using symmetric key cryptography is a non-trivial task. Nevertheless, it is important because public key cryptography is computationally expensive and therefore infeasible 1.0 implement on some small, battery-powered devices with limited memory. We study methods for allocating symmetric keys to devices before deployment, known as key predistribution schemes. Using combinatorial techniques, we analyse and design a variety of key predistribution schemes. We provide a correction to the previously stated formula for calculating the resilience of certain random key predistribution schemes, presenting instead a rigorously proved and widely applicable formula. We also present a simplified formula for calculating the connectivity. Next, we examine the role of expander graphs ill key predistribution schemes. We demonstrate that good expansion is desirable for robust schemes, and discuss how this can be achieved. In particular, we examine the expansion of key prcdistribution schemes built from expander graph constructions, which provide perfect resilience.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available