Relevant Researches On Ad-hoc Network Key Ｍanagement Scheme

Ad-hoc network is a new type of mobile networks, and it is very different from traditional wireless networks. It does not depend on any fixed infrastructure and management center, but it can maintain the network connection and data transfer by the mutual cooperation and self-organization between mobile nodes that have limited transmission range. Ad-hoc network has its unique structure, which produces some outstanding features. A dynamic topology, distributed operation, the limited resources. In addition, the network self-organization, the node mobility and wireless communication channels make the Ad-hoc networks being more vulnerable to various attacks. The security problem more severe, and Ad-hoc key management is the core technology of network security, therefore, in order to protect the Ad-hoc network information availability, confidentiality, integrity and authentication, how to create a safe and efficient key management of Ad-hoc network is a key issue. This paper made the following work for Ad-hoc network key management:(1) After studying the existing, it presented a suitable Ad-hoc networks key management scheme, which used identity-based cryptosystem without trusted center. It effectively solved the issue of trust between nodes. And it gived a user key online periodically update mechanism to achieve the key dynamic management.(2) After studying the secret sharing techniques based on symmetric bi-variate polynomial, a fully decentralized Ad-hoc network key management scheme was proposed. The nodes met the threshold conditions can set up network without any trust dealer. A new node can join the network any time without interactive of online nodes, and it also can acquire the same ability as the initial nodes and its private key after joining the network. The scheme firstly proposes using Newton polynomial interpolation in the process of key management in Ad-hoc networks, which improve the efficiency of the key management.(3) It proposed a new efficient identity-based signcryption scheme using the bilinear pairings and both the combination of public and private key crypto systems, and it was very suitable for the Ad-hoc network key management. It also proved the scheme's security in the random oracle model while assuming the hardness of Bilinear Diffie-Hellman (BDH) problem and Decisional Bilinear Diffie-Hellman (DBDH) problem. Compared with the existing identity-based signcryption scheme, the sheme has less computation and ciphertext length, so it is especially suitable for the Ad-hoc network key management.