We look at node seizure attack with an adversarial standpoint. In this sort of attack, the attacker strategically took the control over the node and intercepts the private encrypted data that is being send over the node, so that it can compromise the networks protection for safety, privacy, and dependability. Adversarial models are vital for understanding and extenuating security threats. These models help to simulate potential attacks and develop countermeasures. We observe that study of adversary behavior is essential for developing robust security measures in WSNs. We present path node compromise matrix that leverage attack values of nodes created on the redundancy of nodes in each route in the network to enhance attacking efficiency. The proposed model’s key merit is that it incorporates redundancy of nodes in path evaluating the vulnerability. It then classifies the network nodes in to safe and vulnerable nodes. Hashed predistribution is used to distribute the keying information in the nodes. It aims to reduce the unnecessary hashing on the keys of all nodes. Instead, it applies hashing on subset of nodes only. It makes it more efficient as compare to the basic scheme. It is shown that key compromise probability is reduced in proposed scheme as compare to basic scheme.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Hashed Keys Generation for IoT-Based WSN

  • Priyanka Ahlawat

摘要

We look at node seizure attack with an adversarial standpoint. In this sort of attack, the attacker strategically took the control over the node and intercepts the private encrypted data that is being send over the node, so that it can compromise the networks protection for safety, privacy, and dependability. Adversarial models are vital for understanding and extenuating security threats. These models help to simulate potential attacks and develop countermeasures. We observe that study of adversary behavior is essential for developing robust security measures in WSNs. We present path node compromise matrix that leverage attack values of nodes created on the redundancy of nodes in each route in the network to enhance attacking efficiency. The proposed model’s key merit is that it incorporates redundancy of nodes in path evaluating the vulnerability. It then classifies the network nodes in to safe and vulnerable nodes. Hashed predistribution is used to distribute the keying information in the nodes. It aims to reduce the unnecessary hashing on the keys of all nodes. Instead, it applies hashing on subset of nodes only. It makes it more efficient as compare to the basic scheme. It is shown that key compromise probability is reduced in proposed scheme as compare to basic scheme.