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.
Partially supported by EU within the 7th Framework Programme, contract 215270 (FRONTS).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Eschenauer, L., Gligor, V.D.: A key management scheme for distributed sensor networks. In: 9th ACM Conference on Computer and Communication Security (CCS 2002), pp. 41–47. ACM, New York (2002)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEEE Symp. Security Privacy, pp. 197–213. IEEE, Los Alamitos (2003)
Liu, D., Ning, P.: Improving key predistribution with deployment knowledge in static sensor networks. TOSN 1(2), 204–239 (2005)
Du, W., Deng, J., Han, Y.S., Varshney, P.K.: A key predistribution scheme for sensor networks using deployment knowledge. IEEE Trans. Dependable Sec. Comput. 3(1), 62–77 (2006)
Du, W., Deng, J., Han, Y.S., Varshney, P.K., Katz, J., Khalili, A.: A pairwise key predistribution scheme for wireless sensor networks. ACM Trans. Inf. Syst. Secur. 8(2), 228–258 (2005)
Blom, R.: An optimal class of symmetric key generation systems. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 335–338. Springer, Heidelberg (1985)
Traynor, P., Kumar, R., Choi, H., Cao, G., Zhu, S., Porta, T.F.L.: Efficient hybrid security mechanisms for heterogeneous sensor networks. IEEE Trans. Mob. Comput. 6(6), 663–677 (2007)
Bellare, M., Yee, B.S.: Forward-security in private-key cryptography. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 1–18. Springer, Heidelberg (2003)
Stević, S.: Asymptotic behavior of a sequence defined by iteration. Matematicki Vesnik 48(3-4), 99–105 (1966)
Gardy, D.: Occupancy urn models in the analysis of algorithms. Journal of Statistical Planning and Inference 101(1), 95–105 (2002)
Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. John Wiley and Sons, Chichester (2001)
Krawczyk, H., Rabin, T.: Chameleon signatures, pp. 143–154 (2000)
Ren, M., Kanti Das, T., Zhou, J.: Diverging keys in wireless sensor networks. In: Katsikas, S.K., López, J., Backes, M., Gritzalis, S., Preneel, B. (eds.) ISC 2006. LNCS, vol. 4176, pp. 257–269. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cichoń, J., Grza̧ślewicz, J., Kutyłowski, M. (2009). Key Levels and Securing Key Predistribution against Node Captures. In: Dolev, S. (eds) Algorithmic Aspects of Wireless Sensor Networks. ALGOSENSORS 2009. Lecture Notes in Computer Science, vol 5804. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-05434-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-05434-1_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-05433-4
Online ISBN: 978-3-642-05434-1
eBook Packages: Computer ScienceComputer Science (R0)