Abstract
A novel key pre-distribution scheme for sensor networks is proposed, which enables sensor nodes to communicate securely with each other using cryptographic techniques. The approach uses the rational normal curves in the projective space with the dimension n over the finite field \( \mathbb{F}_q \). Both secure connectivity and resilience of the resulting sensor networks are analyzed. By choosing the parameters q and n properly, this key pre-distribution scheme has some advantages over the previous known schemes. In addition, if the number of the rational normal curves in the scheme becomes too large for an application, the size may be reduced by choosing a part of the curves randomly. This reduction has, shown by our experiments, only minimal impact on secure connectivity and resilience of the resulting sensor network.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Eschenauer L, Gligor V B. A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM Conference on Computer and Communications Security, Washington, DC, USA, 2002. 41–47
Chan H, Perrig A, Song D. Random key pre-distribution schemes for sensor networks. In: IEEE Symposium on Research in Security and Privacy, Washington DC, 2003. 197–213
Du W, Deng J, Han Y S, et al. A pairwise key pre-distribution scheme for wireless sensors. In: Proceeding of the 10th ACM Conference on Computer and Communications Security (CCS), Washington DC, 2003. 42–51
Liu D, Ning P. Establishing pairwise keys in distributed sensor networks. In: Proceedings of the 10th ACM Conference on Computer and Communications Security, Washington, DC, USA, 2003. 52–61
Çamtepe S A, Yener B. Combinatorial design of key distribution mechanisms for wireless sensor networks. Technical Report TR-04-10, 2004
Lee J, Stinson D R. Deterministic key pre-distribution schemes for sonsor networks. In: SAC 2004, Lecture Notes of Computer Science 3357. Nicosia, Cyprus 2004. 294–307
Lee J, Stinson D R. A combinatorial approach to key pre-distribution for distributed sensor networks. In: WCNC 2005, IEEE Wireless Computing and Networking Conference, New Orleans, LA, USA, 2005. 1200–1205
Wei R, Wu J. Product construction of key distribution schemes for network. In: SAC 2004 Proceedings, Lecture Notes in Computer Science 3357. Berlin: Springer, 2005. 280–293
Chakrabarti D, Maitra S, Roy B. A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design. Int J Inf Security, 2006, 5: 105–114
Street A P, Street D J. Combinatorics of Experimental Design. Oxford: Clarendon Press, 1987
Pei D Y. Authentication Codes and Combinatorial Designs. Boca Raton: Chapman & Hall/CRC, 2006
Pei D Y. A problem of combinatorial designs related to authentication codes. J Combin Des, 1998, 6: 417–429
Dong J W, Pei D Y, Wang X L. A key pre-distribution schemes based on 3-designs. In: The proceedings of Inscrypt2007, Lecture Notes in Computer Sciences 4990. Beilin: Springer 2008. 81–92
Dong J W, Pei D Y, Wang X L. A class of key pre-distribution schemes based on orthogonal arrays. J Compul Sci Tech, 2008, 23: 825–831
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pei, D., Dong, J. & Rong, C. A novel key pre-distribution scheme for wireless distributed sensor networks. Sci. China Inf. Sci. 53, 288–298 (2010). https://doi.org/10.1007/s11432-010-0005-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11432-010-0005-0