Research On Group Key Management Scheme Based On Secret Sharing Scheme

The key negotiation and management both are the basis of network information confidentiality in wireless sensor networks (WSN). In addition to basic security requirements such as confidentiality and integrity. The focus is needed to meet the security requirements such as robustness, self-organization and authentication in related researches. Moreover, wireless sensor nodes have some basic characteristics such as low-computation, small-storage and limited energy, these features lead to 1)nodes joining and exiting frequently 2) difficulty to rely on-online trusted third party(TTP). In the current study, the pairwise key negotiation scheme can be used to implement the key negotiation simply and effectively, but there are many defects such as large storage, poor scalability and flexibility. However, The group key scheme not only has strong robustness, but also has good flexibility. It is easy to negotiate key by user self-organization fully and new user join dynamically and identity authentication mechanism. Furthermore, the group key scheme also has the advantage of computation in communication.Secret sharing is an important method of key management in cryptography. The main idea of secret sharing is to split the secret into shares and secret recovery by shareholders. With the process of secret sharing, it is relatively simple to implement group key negotiation scheme effectively and flexibly, further, they can satisfy the security requirements in the application very well. Therefore, this is of the great significance to information security in application to provide an effective, secure and flexible key negotiation in management mechanism using secret sharing into group key.In this paper, we propose two kinds of group key negotiation schemes based on the previous research of key negotiation and management scheme in WSNs and the in-depth research on secret sharing theory.1.This paper design a simple group key negotiate scheme based on secret sharing that can resist the coalition up to t-1 internal attackers with high robustness; Is able to complete the key negotiation without online TTP with high self-organization;Is able to authenticate all participants effectively and have the ability to identify illegal participants; Eliminate the dependence of pre-existing secure channels between users to meet the security requirements in the application. Compared with Liu's pairwise key negotiation scheme based on secret sharing, the group key scheme is more flexible and scalable and has obvious advantage of computation in communication.2.On the basis of simple group key scheme, a group key negotiation scheme is proposed to support the users to join dynamically. The advantage is to achieve a new user dynamic access to the security mechanism, in the absence of TTP authentication under the new user identity and negotiate the new group key and has simple self-healing function. In addition, this scheme is optimized, more effective and efficient as well as more secure compared with previous schemes. The proposed scheme can support new users to join effectively and more comprehensively to meet the security requirements in application and solve the channel reliability problem of secret sharing.