Key levels and securing key predistribution against node captures

9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We consider key predistribution schemes deployed for securing communication in ad hoc networks of tiny devices. As node captures are inevitable in these networks and the devices are likely non tamper-proof, an adversary can collect the keys and decrypt some transmissions. We propose and analyze key levels technique that can be used on top of most key predistribution schemes in order to reduce chances of an adversary. The modification does not increase the number of keys loaded into a device, while it increases the computational cost in an insignificant way. Also, it composes well into a framework of adaptive key management allowing to refresh the keys without causing incompatibility problems with the devices holding the old keys. Finally, we show how to reduce the number of keys in a device for random key predistribution by an appropriate construction of the pool of keys. © 2009 Springer-Verlag.

Cite

CITATION STYLE

APA

Cichoń, J., Grza̧ślewicz, J., & Kutyłowski, M. (2009). Key levels and securing key predistribution against node captures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5804 LNCS, pp. 64–75). https://doi.org/10.1007/978-3-642-05434-1_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free