Abstract
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n we derive the optimal value that is jointly achievable for parameters like, Size optimality: using less memory per node – while supporting large network, Connectivity optimality: possibility of establishing secure communication between any two nodes over short path, and Resiliency optimality: large fraction of network remains working under compromise or node capture. We characterize this relation in graph theoretic framework. Our result shows that the desired graph (a combination of network topology graph on which key-share graph is embedded) must have small clique and independent set and must have high expansion properties, in other words Expander graphs are best suited for forming secure networks.
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
Alon, N.: Eigenvalues and expanders. Combinatorica 6(2), 83–96 (1986)
Alon, N.: The shannon capacity of a union. Combinatorica 18(3), 301–310 (1998)
Alon, N., Babai, L., Suzuki, H.: Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems. J. Comb. Theory Ser. A 58(2), 165–180 (1991)
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)
Blundo, C., Santis, A.D., Herzberg, A., Kutten, S., Vaccaro, U., Yung, M.: Perfectly-secure key distribution for dynamic conferences. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 471–486. Springer, Heidelberg (1993)
Çamtepe, S.A., Yener, B.: Combinatorial design of key distribution mechanisms for wireless sensor networks. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol. 3193, pp. 293–308. Springer, Heidelberg (2004)
Çamtepe, S.A., Yener, B.: Key distribution mechanisms for wireless sensor networks: a survey. RPI Technical Report TR-05-07, RPI (2005)
Çamtepe, S.A., Yener, B., Yung, M.: Expander graph based key distribution mechanisms in wireless sensor networks. In: IEEE International Conference on Communications (ICC) 2006 (to appear, 2006)
Chakrabarti, D., Maitra, S., Roy, B.K.: A key pre-distribution scheme for wireless sensor networks: Merging blocks in combinatorial design. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 89–103. Springer, Heidelberg (2005)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: SP 2003: Proceedings of the 2003 IEEE Symposium on Security and Privacy, p. 197. IEEE Computer Society, Washington (2003)
Du, W., Deng, J., Han, Y.S., Varshney, P.K.: A pairwise key pre-distribution scheme for wireless sensor networks. In: CCS 2003: Proceedings of the 10th ACM conference on Computer and communications security, pp. 42–51. ACM Press, New York (2003)
Erdös, P., Rényi, A.: On the evolution of random graphs. Institute of Mathematics Hungarian Academy of Sciences 5, 17–61 (1960)
Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: CCS 2002: Proceedings of the 9th ACM conference on Computer and communications security, pp. 41–47. ACM Press, New York (2002)
Hwang, J., Kim, Y.: Revisiting random key pre-distribution schemes for wireless sensor networks. In: SASN 2004: Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks, pp. 43–52. ACM Press, New York (2004)
Lee, J., Stinson, D.R.: Deterministic key predistribution schemes for distributed sensor networks. In: Selected Areas in Cryptography, pp. 294–307 (2004)
Lee, J., Stinson, D.R.: A combinatorial approach to key predistribution for distributed sensor networks. In: IEEE Wireless Communications and Networking Conference, vol. 2, pp. 1200–1205 (2005)
Liu, D., Ning, P.: Establishing pairwise keys in distributed sensor networks. In: CCS 2003: Proceedings of the 10th ACM conference on Computer and communications security, pp. 52–61. ACM Press, New York (2003)
Liu, D., Ning, P.: Location-based pairwise key establishments for static sensor networks. In: SASN 2003: Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks, pp. 72–82. ACM Press, New York (2003)
Liu, D., Ning, P., Li, R.: Establishing pairwise keys in distributed sensor networks. ACM Trans. Inf. Syst. Secur. 8(1), 41–77 (2005)
Panconesi, A., Radhakrishnan, J.: Expansion properties of (secure) wireless networks. In: SPAA 2004: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 281–285. ACM Press, New York (2004)
Pietro, R.D., Mancini, L.V., Mei, A., Panconesi, A., Radhakrishnan, J.: Connectivity properties of secure wireless sensor networks. In: SASN 2004: Proceedings of the 2nd ACM workshop on Security of ad hoc and sensor networks, pp. 53–58. ACM Press, New York (2004)
Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wirel. Netw. 10(2), 169–181 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghosh, S.K. (2006). On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks. In: Buttyán, L., Gligor, V.D., Westhoff, D. (eds) Security and Privacy in Ad-Hoc and Sensor Networks. ESAS 2006. Lecture Notes in Computer Science, vol 4357. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11964254_12
Download citation
DOI: https://doi.org/10.1007/11964254_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69172-3
Online ISBN: 978-3-540-69173-0
eBook Packages: Computer ScienceComputer Science (R0)