Advertisement

On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks

  • Subhas Kumar Ghosh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4357)

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.

Keywords

Sensor Network Sensor Node Wireless Sensor Network Product Graph Network Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alon, N.: Eigenvalues and expanders. Combinatorica 6(2), 83–96 (1986)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Alon, N.: The shannon capacity of a union. Combinatorica 18(3), 301–310 (1998)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    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)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    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)CrossRefGoogle Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Ç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)CrossRefGoogle Scholar
  7. 7.
    Çamtepe, S.A., Yener, B.: Key distribution mechanisms for wireless sensor networks: a survey. RPI Technical Report TR-05-07, RPI (2005)Google Scholar
  8. 8.
    Ç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)Google Scholar
  9. 9.
    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)CrossRefGoogle Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)CrossRefGoogle Scholar
  12. 12.
    Erdös, P., Rényi, A.: On the evolution of random graphs. Institute of Mathematics Hungarian Academy of Sciences 5, 17–61 (1960)MATHGoogle Scholar
  13. 13.
    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)CrossRefGoogle Scholar
  14. 14.
    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)CrossRefGoogle Scholar
  15. 15.
    Lee, J., Stinson, D.R.: Deterministic key predistribution schemes for distributed sensor networks. In: Selected Areas in Cryptography, pp. 294–307 (2004)Google Scholar
  16. 16.
    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)Google Scholar
  17. 17.
    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)CrossRefGoogle Scholar
  18. 18.
    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)CrossRefGoogle Scholar
  19. 19.
    Liu, D., Ning, P., Li, R.: Establishing pairwise keys in distributed sensor networks. ACM Trans. Inf. Syst. Secur. 8(1), 41–77 (2005)CrossRefGoogle Scholar
  20. 20.
    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)CrossRefGoogle Scholar
  21. 21.
    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)CrossRefGoogle Scholar
  22. 22.
    Xue, F., Kumar, P.R.: The number of neighbors needed for connectivity of wireless networks. Wirel. Netw. 10(2), 169–181 (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Subhas Kumar Ghosh
    • 1
  1. 1.Honeywell Technology Solutions Lab.BangaloreIndia

Personalised recommendations