Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network
---
paper_title: Enhancing Efficiency of Node Compromise Attacks in Vehicular Ad-hoc Networks Using Connected Dominating Set

paper_content:

In the node compromise attack, the adversary physically captures nodes and extracts the cryptographic keys from the memories, which destroys the security, reliability and confidentiality of the networks. Due to the dynamical network topology, designing an efficient node compromise attack algorithm is challenging, because it is difficult to model the attack or to enhance the attacking efficiency. In this paper, a general algorithm for modeling the node compromise attack in VANET is proposed, which promotes the attacking efficiency by destroying the network backbone. The backbone is constructed using the connected dominating set of the network, which has relevant to the intermeeting time between the vehicles. Then two attacking algorithms are proposed based on the general model, which destroy the network in a centralized and distributed version while maximizing the destructiveness. Simulations are conducted to show the advantages of our scheme. Simulation results reveal that our scheme enhances the attacking efficiency in different mobility models and different applications, which is suitable for modeling the node compromise attack in VANET. At last, discussions are presented to the illustrate the influences of the characteristics to the attacking efficiency with respect to vehicle speed, communication range and key sharing probability.
---
paper_title: Evaluating the Vulnerability of Network Traffic Using Joint Security and Routing Analysis

paper_content:

Joint analysis of security and routing protocols in wireless networks reveals vulnerabilities of secure network traffic that remain undetected when security and routing protocols are analyzed independently. We formulate a class of continuous metrics to evaluate the vulnerability of network traffic as a function of security and routing protocols used in wireless networks. We develop two complementary vulnerability definitions using set theoretic and circuit theoretic interpretations of the security of network traffic, allowing a network analyst or an adversary to determine weaknesses in the secure network. We formalize node capture attacks using the vulnerability metric as a nonlinear integer programming minimization problem and propose the GNAVE algorithm, a Greedy Node capture Approximation using Vulnerability Evaluation. We discuss the availability of security parameters to the adversary and show that unknown parameters can be estimated using probabilistic analysis. We demonstrate vulnerability evaluation using the proposed metrics and node capture attacks using the GNAVE algorithm through detailed examples and simulation.
---
paper_title: Deployment-aware modeling of node compromise spread in wireless sensor networks using epidemic theory

paper_content:

Motivated by recently surfacing viruses that can spread over the air interfaces, in this article, we investigate the potentially disastrous threat of node compromise spreading in wireless sensor networks. We assume such a compromise originating from a single infected node, can propagate to other sensor nodes via communication and pre-established mutual trust. We focus on the possible epidemic breakout of such propagations where the whole network may fall victim to the attack. Using epidemic theory, we model and analyze this spreading process and identify key factors determining potential outbreaks. In particular, we perform our study on random graphs precisely constructed according to the parameters of the network, such as distance, key sharing constrained communication and node recovery, thereby reflecting the true characteristics therein. Moreover, a comparative study of the epidemic propagation is performed based on the effects of two types of sensor deployment strategies, viz., uniform random and group-based deployment. The analytical results provide deep insights in designing potential defense strategies against this threat. Furthermore, through extensive simulations, we validate the model and perform investigations on the system dynamics. Our analysis and simulation results indicate that the uniform random deployment is more vulnerable to an epidemic outbreak than the group based deployment strategy.
---
paper_title: Modeling node capture attacks in wireless sensor networks

paper_content:

We formalize a model for node capture attacks in which an adversary collects information about the network via eavesdropping on the wireless medium and captures nodes based on the learned information. We show that attacks in this adversary model correspond to NP-hard optimization problems and discuss the behavior of a reasonable heuristic algorithm. We show that the goals of node capture attacks can be decomposed into a collection of primitive events, the impact of which can be evaluated and recombined to yield an overall evaluation of the attack. We demonstrate the use of the attack decomposition model for derivation of attack metrics and discuss the potential use of this decomposition technique for the purposes of defense against node capture attacks.
---
paper_title: Node capture attacks in wireless sensor networks: A system theoretic approach

paper_content:

In this paper we address the problem of physical node capture attacks in wireless sensor networks and provide a control theoretic framework to model physical node capture, cloned node detection and revocation of compromised nodes. By combining probabilistic analysis of logical key graphs and linear control theory, we derive a dynamical model that efficiently describes network behavior under attack. Using LQR and LQG optimal control theory tools, we develop a network response strategy, which guarantees secure network connectivity and stability under attack. Detailed simulations are presented to validate the methodology.
---
paper_title: Modeling adaptive node capture attacks in multi-hop wireless networks

paper_content:

We investigate the problem of modeling node capture attacks in heterogeneous wireless ad hoc and mesh networks. Classical adversarial models such as the Dolev-Yao model are known to be unsuitable for describing node capture attacks. By defining the amortized initialization overhead cost as well as the cost of capturing a node, we show that finding the node capture attack yielding the minimum cost can be formulated as an integer-programming minimization problem. Hence, there is no polynomial solution to find the minimum cost node capture attack. We show that depending on the adversary's knowledge of the constraint matrix in the integer-programming problem, different greedy heuristics can be developed for node capture attacks. We also show under what conditions privacy-preserving key establishment protocols can help to prevent minimum cost node capture attacks. Individual node storage randomization is investigated as a technique to mitigate the effect of attacks which are not prevented by the use of privacy-preserving protocols. It is shown that probabilistic heuristic attacks can be performed effectively even under storage randomization.
---
paper_title: Enhancing the attacking efficiency of the node capture attack in WSN: a matrix approach

paper_content:

In the node capture attack, the adversary intelligently captures nodes and extracts the cryptographic keys from their memories to destroy the security, reliability and confidentiality of the wireless sensor networks. However, it suffers from low attacking efficiency and high resource expenditure. In this paper, we approach this attack from an adversarial view and develop a matrix-based method to model the process of the node capture attack. We establish a matrix to indicate the compromising relationship between the nodes and the paths. We propose a Matrix-based node capture attack Algorithm (MA in short), which can maximize the destructiveness while consuming the minimum resource expenditure. We conduct several experiments to show the performance of MA. Experimental results manifest that MA can reduce the attacking round, shorten the execution time, enhance the attacking efficiency and conserve the energy cost.
---
paper_title: Adversary Information Gathering Model for Node Capture Attack in Wireless Sensor Networks

paper_content:

Node capture attack is considered to be one of the most serious attack in WSN. An adversary physically captures a node so that she can steal all the confidential information stored in it and can launch further attacks by deploying clones of a captured node. To achieve this she needs to gather useful information regarding the network before capturing a node. Hence, a node capture by an adversary depends on how quickly she is able to gather the information regarding the network and about the target node. In this paper we have proposed a model for the process of gathering information by an adversary. We have also found the expected amount of information an adversary have at an arbitrary time t. Using the above information we proposed the expected time of a node capture based on the strength of an adversary and the dynamicity of the network.
---
paper_title: A high efficient node capture attack algorithm in wireless sensor network based on route minimum key set

paper_content:

Wireless sensor networks are often deployed in hostile and unattended environment that are very prone to node capture attack. In node capture attack, information such as key, data on captured nodes, can all be extracted by the adversary. Node capture attack in wireless sensor networks suffers from low efficiency and high resource expenditure. To enhance the efficiency of node capture attack, we propose here a high efficiency node capture attack algorithm that is based on route minimum key set, namely greedy node captured based on route minimum key set (GNRMK). To obtain the route minimum key set, the sensor network is mapped as a flow network. The route minimum key set can be calculated by the maximum flow of the flow network. Then, an overlapping value is assigned to each node on the basis of route minimum key set. The node with maximum overlapping value will be captured in every round of attack. Simulation results indicate that, compared with other node capture attack schemes, GNRMK can compromise the network by capturing fewer nodes. Moreover, the fraction of traffic compromised is much higher. Copyright © 2012 John Wiley & Sons, Ltd.
---
paper_title: Key Predistribution Schemes for Establishing Pairwise Keys with a Mobile Sink in Sensor Networks

paper_content:

Security services such as authentication and pairwise key establishment are critical to sensor networks. They enable sensor nodes to communicate securely with each other using cryptographic techniques. In this paper, we propose two key predistribution schemes that enable a mobile sink to establish a secure data-communication link, on the fly, with any sensor nodes. The proposed schemes are based on the polynomial pool-based key predistribution scheme, the probabilistic generation key predistribution scheme, and the Q-composite scheme. The security analysis in this paper indicates that these two proposed predistribution schemes assure, with high probability and low communication overhead, that any sensor node can establish a pairwise key with the mobile sink. Comparing the two proposed key predistribution schemes with the Q-composite scheme, the probabilistic key predistribution scheme, and the polynomial pool-based scheme, our analytical results clearly show that our schemes perform better in terms of network resilience to node capture than existing schemes if used in wireless sensor networks with mobile sinks.
---
paper_title: Distributed detection of node replication attacks in sensor networks

paper_content:

The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze and replicate them, and surreptitiously insert these replicas at strategic locations within the network. Such attacks may have severe consequences; they may allow the adversary to corrupt network data or even disconnect significant parts of the network. Previous node replication detection schemes depend primarily on centralized mechanisms with single points of failure, or on neighborhood voting protocols that fail to detect distributed replications. To address these fundamental limitations, we propose two new algorithms based on emergent properties (Gligor (2004)), i.e., properties that arise only through the collective action of multiple nodes. Randomized multicast distributes node location information to randomly-selected witnesses, exploiting the birthday paradox to detect replicated nodes, while line-selected multicast uses the topology of the network to detect replication. Both algorithms provide globally-aware, distributed node-replica detection, and line-selected multicast displays particularly strong performance characteristics. We show that emergent algorithms represent a promising new approach to sensor network security; moreover, our results naturally extend to other classes of networks in which nodes can be captured, replicated and re-inserted by an adversary.
---
paper_title: Double hash function scheme in wireless sensor networks

paper_content:

Wireless sensor networks are a new class of distributed systems that are an integral part of the physical space they inhabit. Key distribution plays an important role in wireless sensor networks. In WSN, node capture attack is the most series attack. The aim of this paper is to improve the resistance against the node capture attack. So a double hash function key pre-distribution scheme is used to stop an adversary to get information of non-compromised sensor nodes from the compromised sensor nodes and the deployment model, is based on hexagonal to improve the local connectivity. The proposed scheme provides the best resilience against sensor nodes capture and the probability of links between any sensor nodes are compromised is zero after pair wise keys establishment.
---
paper_title: Node capture attacks in wireless sensor networks: A system theoretic approach

paper_content:

In this paper we address the problem of physical node capture attacks in wireless sensor networks and provide a control theoretic framework to model physical node capture, cloned node detection and revocation of compromised nodes. By combining probabilistic analysis of logical key graphs and linear control theory, we derive a dynamical model that efficiently describes network behavior under attack. Using LQR and LQG optimal control theory tools, we develop a network response strategy, which guarantees secure network connectivity and stability under attack. Detailed simulations are presented to validate the methodology.
---
paper_title: Resilience Against Node Capture Attack using Asymmetric Matrices in Key Predistribution Scheme in Wireless Sensor Networks

paper_content:

Wireless Sensor Networks (WSN) usually consists of a large number of tiny sensors with limited computation capability, memory space and power resource. WSN's are extremely vulnerable against any kind of internal or external attacks, due to several factors such as resource constrained nodes and lack of tamper- resistant packages. To achieve security in Wireless Sensor Networks, it is important to encrypt messages sent among sensor nodes. In this paper, we propose a scheme called Modified Bloom's Scheme (MBS) that uses asymmetric matrices of keys in place of symmetric matrices in order to establish secret keys between node pairs. The network resilience against node capture attack is improved using the proposed scheme.
---
paper_title: Improving Resilience Against Node Capture Attacks in Wireless Sensor Networks Using ICmetrics

paper_content:

Wireless Sensor Networks (WSNs) have the potential of being employed in a variety of applications ranging from battlefield surveillance to everyday applications such as smart homes and patient monitoring. Security is a major challenge that all applications based on WSNs are facing nowadays. Firstly, due to the wireless nature of WSNs, and secondly due to their ability to operate in unattended environments makes them even more vulnerable to various sorts of attacks. Among these attacks is node capture attack in WSNs, whose threat severity can range from a single node being compromised in the network to the whole network being compromised as a result of that single node compromise. In this paper, we propose the use of ICMetric technology to provide resilience against node compromise in WSN. ICmetrics generates the security attributes of the sensor node based on measurable hardware and software characteristics of the integrated circuit. These properties of ICmetrics can help safeguard WSNs from various node capture attacks.
---
paper_title: Distributed Detection of Node Capture Attacks in Wireless Sensor Networks

paper_content:

Wireless sensor networks are vulnerable to node capture attacks because sensor nodes are usually deployed in unattended manner. Once attacker captures sensor nodes, he can compromise them and launch various types of attacks with those compromised nodes. Therefore, node capture attacks are hazardous and should be detected as soon as possible to reduce the harm incurred by them. To meet this need, we propose a node capture detection scheme in wireless sensor networks. Our scheme detects the captured sensor nodes by using the sequential analysis. We analytically show that our scheme detects node capture attacks in robust and efficient manner.
---

Title: Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network

Section 1: INTRODUCTION
Description 1: Write an introduction about Wireless Sensor Networks (WSNs), including their structure, components, applications, and security challenges, particularly focusing on the significance of securing WSNs against node capture attacks.

Section 2: NODE CAPTURE ATTACK
Description 2: Describe in detail what a node capture attack is, how it is performed, and its impact on the confidentiality, integrity, and security of Wireless Sensor Networks.

Section 3: SURVEY OF MODELING OF NODE CAPTURE ATTACK USING DIFFERENT SCHEMES
Description 3: Provide an extensive survey of different models and techniques used to understand and analyze node capture attacks. Include references to mathematical models, heuristic algorithms, control-theory approaches, and probabilistic models.

Section 4: SURVEY OF VARIOUS DETECTION AND KEY PREDISTRIBUTION SCHEMES USED FOR RESILIENCE AGAINST NODE CAPTURE ATTACK
Description 4: Discuss various detection methods and key predistribution strategies developed to improve the resilience of WSNs against node capture attacks. Explain different schemes and their effectiveness in protecting the network.

Section 5: CONCLUSIONS
Description 5: Summarize the key points discussed in the paper, emphasizing the importance of researching node capture attack mechanisms and the effectiveness of different modeling, detection, and key predistribution schemes to enhance the security of Wireless Sensor Networks.