Key Recoverability in Wireless Sensor Networks
Filippo Gandino, Antonio Servetti
IEEE Access · 2019
doi:10.1109/access.2019.2952945 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In case of an adversary that compromises a node in a wireless sensor network (WSN) and obtains its secret material, techniques for the detection of malicious or compromised nodes have been proposed in several papers. However, the ability to recover secure communications after a compromised node has been detected has not been thoroughly investigated. Such an ability allows to evaluate the level of proper functionality, i.e., the ratio of secure links in the network, that can be recovered after a successful attach and the withdrawal of the compromised secret material. This paper defines and discusses for the first time the recoverability property and provides the formulas to compute it for the main state-of-the-art key management schemes. All the formulas are validated through extensive simulation.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.