Key establishment is the basic step for the wireless sensor network （WSN） security. The polynomial based key predistribution scheme of Blom and Blundo et al. has been the basic ingredient for the key establishment f...Key establishment is the basic step for the wireless sensor network （WSN） security. The polynomial based key predistribution scheme of Blom and Blundo et al. has been the basic ingredient for the key establishment for WSNs. It is tempting to use many random and different instances of polynomial based key predistribution scheme for various parts of the WSN to enhance the efficiency of WSN key establishment protocols. This paper indicates that it is not secured in general to use many instances of Blom-Blundo et al. polynomial based key predistribution scheme in a WSN key establishment protocol. Thus the previously constructed group-based type WSN key predistribution schemes using polynomial based key predistribution scheme are insecure. We propose new generalized Bloin-Blundo et al. key predistribution schemes. These new generalized Blom-Blundo et al. key predistribution schemes can be used many times in one WSN key establishment protocol with only a small increase of cost. The application to group-based WSN key predistribution schemes is given.展开更多
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 a...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.展开更多
Abstract Key distribution patterns （KDPs） are finite incidence structures satisfying a certain property which makes them widely used in minimizing the key storage and ensuring the security of communication between u...Abstract Key distribution patterns （KDPs） are finite incidence structures satisfying a certain property which makes them widely used in minimizing the key storage and ensuring the security of communication between users in a large network. We construct a new KDP using t-design and combine two ω-KDPs to give new （ω- 1）-KDPs, which provide secure communication in a large network and minimize the amount of key storage.展开更多
基金the NSFC Danish National Research Foundation and National Science Foundation of China Joint Grant (No. 11061130539)the National Natural Science Foundation of China (No. 61021004)
文摘Key establishment is the basic step for the wireless sensor network （WSN） security. The polynomial based key predistribution scheme of Blom and Blundo et al. has been the basic ingredient for the key establishment for WSNs. It is tempting to use many random and different instances of polynomial based key predistribution scheme for various parts of the WSN to enhance the efficiency of WSN key establishment protocols. This paper indicates that it is not secured in general to use many instances of Blom-Blundo et al. polynomial based key predistribution scheme in a WSN key establishment protocol. Thus the previously constructed group-based type WSN key predistribution schemes using polynomial based key predistribution scheme are insecure. We propose new generalized Bloin-Blundo et al. key predistribution schemes. These new generalized Blom-Blundo et al. key predistribution schemes can be used many times in one WSN key establishment protocol with only a small increase of cost. The application to group-based WSN key predistribution schemes is given.
基金supported by the National Natural Science Foundation of China under Grant Nos. 60473017, 90604034and 10771078.
文摘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.
基金Acknowledgements This work was supported in part by the National Natural Science Foundation of China （Grant No. 61179026） and the Fundamental Research Funds for the Central Universities （No. 3122016L005）.
文摘Abstract Key distribution patterns （KDPs） are finite incidence structures satisfying a certain property which makes them widely used in minimizing the key storage and ensuring the security of communication between users in a large network. We construct a new KDP using t-design and combine two ω-KDPs to give new （ω- 1）-KDPs, which provide secure communication in a large network and minimize the amount of key storage.
