Advertisement

A Computationally-Efficient Construction for the Matrix-Based Key Distribution in Sensor Network

  • Abedelaziz Mohaisen
  • Nam-Su Jho
  • Dowon Hong
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5576)

Abstract

Key pre-distribution in wireless sensor network is aimed at delivering keys to sensor networks at the low expense of computation, communication, and memory while providing a high degree of security expressed by network resiliency to node capture. In this paper, we introduce a computationally efficient construction for the symmetric matrix-based key distribution. Particularly, this work introduces an original modification over the well known DDHV scheme (by Du et al.). Our modification shows that using a specific structures for the public matrix instead of fully random matrix with elements in ℤ q can reduce the computation overhead for generating the key information and the key itself at the expense of small memory overhead. Our modification guarantees the same level of security for restricted network size. We show an extensive security analysis of the provided scheme in different settings and compare to the relevant works in the literature to demonstrate its merit.

Keywords

wireless sensor network key distribution computation efficiency security 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Eschenauer, L., Gligor, V.D.: A key-management scheme for distributed sensor networks. In: ACM CCS, pp. 41–47 (2002)Google Scholar
  2. 2.
    Chan, H., Perrig, A., Song, D.X.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Security and Privacy, p. 197 (2003)Google Scholar
  3. 3.
    Hwang, J., Kim, Y.: Revisiting random key pre-distribution schemes for wireless sensor networks. In: SASN, pp. 43–52 (2004)Google Scholar
  4. 4.
    Çamtepe, S.A., Yener, B.: Combinatorial design of key distribution mechanisms for wireless sensor networks. IEEE/ACM Trans. Netw. 15(2), 346–358 (2007)CrossRefGoogle Scholar
  5. 5.
    Mohaisen, A., Nyang, D., AbuHmed, T.: Two-level key pool design-based random key pre-distribution in wireless sensor networks. TIIS 2(5), 222–238 (2008)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Liu, D., Ning, P., Sun, K.: Efficient self-healing group key distribution with revocation capability. In: ACM Conference on Computer and Communications Security, pp. 231–240 (2003)Google Scholar
  8. 8.
    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
  9. 9.
    Mohaisen, A., Nyang, D.: Hierarchical grid-based pairwise key predistribution scheme for wireless sensor networks. In: Römer, K., Karl, H., Mattern, F. (eds.) EWSN 2006. LNCS, vol. 3868, pp. 83–98. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Mohaisen, A., Maeng, Y., Nyang, D.: On the grid based key pre-distribution: Toward a better connectivity in wireless sensor networks. In: SSDU, pp. 527–537 (2007)Google Scholar
  11. 11.
    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
  12. 12.
    Mohaisen, A., Hong, D.: Mitigating the ica attack against rotation based transformation for privacy preserving clustering”. ETRI Journal 30(6), 868–870 (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Abedelaziz Mohaisen
    • 1
  • Nam-Su Jho
    • 1
  • Dowon Hong
    • 1
  1. 1.Cryptography Research Team, Information Security Division Electronics and Telecommunication Research InstituteDaejeonKorea

Personalised recommendations