dc.description.abstract | In recently years, Wireless Sensor Networks (WSN) have been deployed for a wide variety of mission-critical applications such as monitoring and sensing in military, airports, and healthcare environments. Due to limited resources and computing constraints, it is impractical to use the expensive tamper-resistant hardware for protecting the secret keying material.
Two of the most serious threats in WSN are node capture attack and malicious code injection. In order to instigate these attacks, the adversary can physically capture
some sensor nodes and steal the keying materials from their internal memories. Also, the captured nodes can be reprogrammed with malicious code and redeployed back. In fact, the compromised node can always behave normally and send forged data to base station.
Therefore, security of the key management for WSN becomes the important issue. Researchers have proposed several threshold secret sharing schemes for preventing above attacks. The scheme adopts the idea of Shamir’s (t,n) threshold secret sharing algorithm to divide the master key into many parts and give each neighbor node its own unique part. However, it is more suitable for hierarchical WSN architecture because of the cluster head has more powerful computational capabilities.
Accordingly, we propose the efficient key management scheme based on trivial secret sharing which is feasible in the distributed WSN architecture. The proposed group-based secret sharing key management scheme via local attestation can not only prevent the node capture attack but also attest whether the internal memories have been maliciously compromised or not. The proposed scheme can tolerate the node broken situation as same as Shamir’s (t,n) threshold secret sharing scheme, but only use the exclusive-or operation.
| en_US |