Skip to main content
SpringerLink
Log in

A Class of Key Predistribution Schemes Based on Orthogonal Arrays

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. In order to ensure this security, many approaches have been proposed recently. One of them is to use key predistribution schemes (KPSs) by means of combinatorial designs. In this paper, we use the Bush’s construction of orthogonal arrays to present a class of key predistribution schemes for distributed sensor networks. The secure connectivity and resilience of the resulting sensor network are analyzed. This KPS constructed in our paper has some better properties than those of the existing schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Gura N, Patel A, Wander A, Eberle H, Shantz S C. Comparing elliptic curve cryptography and RSA on 8-bit CPUs. In Proc. CHES, Cambridge, Boston, USA, LNCS 3156, 2004, pp.119–132.

  2. Dong J, Zou H, Pei D. The design and implementation of ECC card. Journal of Computer Applications, 2005, 25(11): 2549–2553. (In Chinese)

    Google Scholar 

  3. Adam D W, Daniel V B, Christof P. Elliptic curve cryptography on smart cards without coprocessors. In Proc. the Fourth Smart Card Research and Advanced Applications Conference, Bristol, UK, 2000, pp.71–92.

  4. Guajardo J, Blümel R, Krieger U, Paar C. Efficient implementation of elliptic curve cryptosystems on the TI MSP 430x33x family of microcontrollers. In Proc. PKC2001, LNCS 1992, 2001, pp.365–382.

  5. Eschenauer L, Gligor V B. A key management scheme for distributed sensor networks. In Proc. the 9th ACM Conference on Computer and Communications Security, Washington DC, USA, 2002, pp.41–47.

  6. Chan H, Perrig A, Song D. Random key predistribution schemes for sensor networks. In Proc. the IEEE Symposium on Security and Privacy, Washington DC, 2003, pp.197–213.

  7. Du W, Deng J, Han Y, Varsheney P. A pairwise key pre-distribution scheme for wireless sensor networks. In Proc. the 10th ACM Conference on Computer and Communications Security (CCS), Washington DC, USA, October 2003, pp.42–51.

  8. Liu D, Ning P. Establishing pairwise keys in distributed sensor networks. In Proc. the 10th ACM Conference on Computer and Communications Security (ACMCCS), Washington DC, USA, 2003, pp.52–61.

  9. Çamtepe S A, Yener B. Combinatorial design of key distribution mechanisms for wireless sensor networks. Technical Report TR–04–10, RPI Dept. Computer Science, April 2004.

  10. Lee J, Stinson D R. Deterministic key predistribution schemes for sensor networks. In Proc. SAC, Nicosia, Cyprus, Lecture Notes in Computer Science, 3357, 2004, pp.294–307.

  11. Lee J, Stinson D R. A combinatorial approach to key predistribution for distributed sensor networks. In Proc. IEEE Wireless Computing and Networking Conference (WCNC 2005), New Orleans, LA, USA, 2005, pp.1200–1205.

  12. Wei R, Wu J. Product construction of key distribution schemes for network. In Proc. SAC 2004, Lecture Note in Computer Science, 3357, Springer, 2005, pp.280–293.

  13. Dong J, Pei D, Wang X. A key predistribution scheme based on 3-designs. In Proc. Inscrypt 2007, LNCS 4990, 2008, pp.81–92.

  14. Pei D. Authentication Codes and Combinatorial Designs. Chapman & Hall / CRC, 2006.

  15. Bush K A. Orthogonal arrays of index unity. Annals of Mathematical Statistics, 1952, 23: 426–434.

    Article  MATH  MathSciNet  Google Scholar 

  16. Street A P, Street D J. Combinatorics of Experimental Design. Oxford: Clarendon Press, 1987.

  17. Hedayat A S, Sloane N J A, Stufken J. Orthogonal Arrays, Theory and Application. Springer, 1999.

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and Econometrics, Hunan University, Changsha, 410082, China

    Jun-Wu Dong

  2. Institute of Information Security, Guangzhou University, Guangzhou, 510006, China

    Jun-Wu Dong & Ding-Yi Pei

  3. School of Mathematical Sciences, South China Normal University, Guangzhou, 510631, China

    Xue-Li Wang

Authors
  1. Jun-Wu Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ding-Yi Pei
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xue-Li Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jun-Wu Dong.

Additional information

This work was partially supported by the National Natural Science Foundation of China under Grant Nos. 60473017, 90604034 and 10771078.

Electronic supplementary material

Below is the link to the electronic supplementary material.

(PDF 94.2 kb).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dong, JW., Pei, DY. & Wang, XL. A Class of Key Predistribution Schemes Based on Orthogonal Arrays. J. Comput. Sci. Technol. 23, 825–831 (2008). https://doi.org/10.1007/s11390-008-9168-1

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9168-1

Keywords

Search

Navigation