摘要
In order to solve security problem of clustering algorithm, we proposed amethod to enhance the security of the well-known lowest-ID clustering algorithm. This method isbased on the idea of the secret sharing and the (k, n) threshold cryptography, Each node, whetherclusterhead or ordinary member, holds a share of the global certificate, and any k nodes cancommunicate securely. There is no need for any clusterhead to execute extra functions more thanrouting. Our scheme needs some prior configuration before deployment, and can be used in criticalenvironment with small scale. The security-enhancement for Lowest-ID algorithm can also be appliedinto other clustering approaches with minor modification. The feasibility of this method wasverified bythe simulation results.
In order to solve security problem of clustering algorithm, we proposed amethod to enhance the security of the well-known lowest-ID clustering algorithm. This method isbased on the idea of the secret sharing and the (k, n) threshold cryptography, Each node, whetherclusterhead or ordinary member, holds a share of the global certificate, and any k nodes cancommunicate securely. There is no need for any clusterhead to execute extra functions more thanrouting. Our scheme needs some prior configuration before deployment, and can be used in criticalenvironment with small scale. The security-enhancement for Lowest-ID algorithm can also be appliedinto other clustering approaches with minor modification. The feasibility of this method wasverified bythe simulation results.
基金
Supported by the National High Technology Re search and Development Program of China (2003AA142080)
