Abstract
The dynamic establishment of shared information (e.g. secret key) between two entities is particularly important in networks with no pre-determined structure such as wireless sensor networks (and in general wireless mobile ad-hoc networks). In such networks, nodes establish and terminate communication sessions dynamically with other nodes which may have never been encountered before, in order to somehow exchange information which will enable them to subsequently communicate in a secure manner. In this paper we give and theoretically analyze a series of protocols that enables two entities that have never encountered each other before to establish a shared piece of information for use as a key in setting up a secure communication session with the aid of a shared key encryption algorithm. These protocols do not require previous pre-distribution of candidate keys or some other piece of information of specialized form except a small seed value, from which the two entities can produce arbitrarily long strings with many similarities.
This work was partially supported by the European Union project ABC4Trust (Attribute-based Credentials for Trust) funded within the context of the 7th Research Framework Program (FP7).
This is a preview of subscription content, log in via an institution to check access.
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
Carman, D.W., Kruus, P.S., Matt, B.J.: Contstraints and approaches for distributed sensor network security. Technical Report 010, NAI Labs, The Security Research Division Network Associates, Inc. (2000)
Eschenauer, L., Gligor, V.: A key-management scheme for distributed sensor networks. In: 9th ACM Conf. Computing and Comm. Security (CCS 2002), pp. 41–47 (2002)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEE Symposium of Privacy and Security, pp. 197–213 (2003)
Chan, S.-P., Poovendran, R., Sun., M.-T.: A key management scheme in distributed sensor networks using attack probabilities. In: IEEE Global Telecommunications Conference, GLOBECOM (2005)
Chan, H., Perrig, A.: Pike: Peer intermediaries for key establishment in sensor networks. In: Proceedings of the IEEE Infocom (2005)
Du, W., Deng, J., Han, Y.S., Varshney, P.: A pairwise key pre-distribution scheme for wireless sensor networks. In: 10th ACM Conference on Computer and Communications Security, pp. 42–51. ACM Press (2003)
Du, W., Deng, J., Han, Y.S., Chen, S., Varshney, P.: A key management scheme for wireless sensor networks using deployment knowledge. In: IEEE Infocom, pp. 586–597 (2004)
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)
Liu, F., Cheng, X.: A self-configured key establishment scheme for large-scale sensor networks. In: 3rd IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), pp. 447–456 (2006)
Makri, E., Stamatiou, Y.: Distributively increasing the percentage of similarities between strings with application to key agreement. In: 5th International Conference on AD-HOC Networks and Wireless, pp. 211–223 (2006)
Cramer, R.: Introduction to Secure Computation. In: Damgård, I.B. (ed.) EEF School 1998. LNCS, vol. 1561, pp. 16–42. Springer, Heidelberg (1999)
Wormald, N.: The differential equation method for random graph processes and greedy algorithms. Annals of Applied Probability 5, 1217–1235 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Liagkou, V., Makri, E., Spirakis, P., Stamatiou, Y. (2012). A Probabilistic Key Agreement Scheme for Sensor Networks without Key Predistribution. In: Georgiadis, C.K., Jahankhani, H., Pimenidis, E., Bashroush, R., Al-Nemrat, A. (eds) Global Security, Safety and Sustainability & e-Democracy. e-Democracy ICGS3 2011 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 99. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33448-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-33448-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33447-4
Online ISBN: 978-3-642-33448-1
eBook Packages: Computer ScienceComputer Science (R0)