Parameterized key assignment for confidential communication in wireless networks

Predistribution of cryptographic keys is a widely used approach for establishing secure communication between severely resource-constrained nodes with limited or no access to network infrastructure. Many proposed key predistribution schemes make the implicit assumption that message contents need not be kept private from nodes other than the intended recipient. Messages in such schemes are not guaranteed to be confidential—they may be read by nodes within the network other than the intended recipient. In this paper, we present TASK—a symmetric key predistribution scheme that enables secure and confidential communication within wireless networks. TASK distributes keys by generating and reinforcing a series of template key assignment instances. It is parameterized, which allows it to make use of key storage capacities that other recently proposed schemes cannot. We show, through analysis and simulation, that TASK can achieve a level of security superior to that of two recently proposed schemes that also provide confidentiality. We also demonstrate that the techniques used in TASK (namely parameterization, templatization, and selective reinforcement) can be applied to other key assignment schemes for star or bipartite networks