Sensor node compromise detection

Song, Hui; Xie, Liang; Zhu, Sencun; Cao, Guohong

doi:10.1145/1280940.1280993

Cited by 52 publications

(41 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…b) The IDS described in [25] requires neighborhood-wide cooperation to measure distances between nodes in a static network, which allows to detect unexpected changes in localization that are characteristic of a node being manipulated. A similar neighborhood-wide effort can identify Sybil intruders (single nodes that use multiple identities) through signal strength, as described in [11].…”

Section: Inputs Based On the Network Topologymentioning

confidence: 99%

“…To prevent this, the IDS would need countermeasures preventing message alterations, such as choosing the right protocols to have integrity and authenticity of the messages, or using more IDS inputs such as the ones used by [9]. The other way to prevent this attack would be to prevent the compromise of nodes, either through specific inputs (see for instance [31] or [25]). …”

Section: Modeling Existing Idsmentioning

confidence: 99%

See 1 more Smart Citation

Discovering Flaws in IDS Through Analysis of Their Inputs

Jamet

Lafourcade

2014

Foundations and Practice of Security

View full text Add to dashboard Cite

Abstract. To secure Wireless Ad-hoc Networks (WANET) against malicious behaviors, three components are needed: prevention, detection, and response. In this paper, we focus on Intrusion Detection Systems (IDS) for WANET. We classify the different inputs used by the decision process of these IDS, according to their level of cooperation, and the source of their data. We then propose a decision aid which allows automated discovery of attacks for IDS, according to the inputs used. Finally we apply our framework to discover weaknesses in two existing IDS.

show abstract

Section: Inputs Based On the Network Topologymentioning

confidence: 99%

Section: Modeling Existing Idsmentioning

confidence: 99%

Discovering Flaws in IDS Through Analysis of Their Inputs

Jamet

Lafourcade

2014

Foundations and Practice of Security

View full text Add to dashboard Cite

show abstract

“…The public-key protocols have different levels of security and complexity. The protocol presented in [2] uses homomorphic encryption scheme [24], to prevent the node compromise [14] which supports unlimited additive operations and one multiplicative operation on encrypted data.…”

Section: Related Workmentioning

confidence: 99%

Re-authentication in Wireless Sensor Network

Selvalingam¹,

Mahalakshmi²,

Jinna³

2012

IJCA

View full text Add to dashboard Cite

In an unprotected environment of Wireless Sensor Network, the authentication scheme for multicast secure communication has to be designed with limited usage of resources and computation. In Multicast Authentication Based on Batch Signature-Enhanced (MABS-E) scheme, a tree construction to counteract the Denial of Service (DoS) attack requires latency at the sender. This authentication latency leads to the jitter effect on real-time applications at the receiver. In few applications, user mobility is considered for authentication process. And also, due to user mobility, the sensor node is compromised. This paper proposes a technique called Batch based Selective Bin Verification (BSBV), which avoids the construction of merkle tree. It reduces latency and allows the receiver to tolerate DoS attack even in the case where the attack fails to be detected. In order to prevent to compromise a node, re-authentication scheme is employed, can prolong the lifetime of the sensor network is provided. The number of inspections of each packet is decreased when binning technique is used. In BSBV technique, the packet failure rate is decreased to 0.01 from 0.04 because all are verified with the batch verification, when the chosen bin is two. The Packet Delivery Ratio is 82.95% when fifteen malicious nodes are presented.

show abstract

“…In contrast to disables nodes, compromised nodes actively seek to disrupt or paralyze the network. From Song et al (2007) the method of obtaining the compromised nodes and counters are given. Attackers capture the sensor node and reprogram them.…”

Section: Introductionmentioning

confidence: 99%

Enhanced RSACRT for Energy Efficient Authentication to Wireless Sensor Networks Security

Ali¹

2012

American Journal of Applied Sciences

View full text Add to dashboard Cite

Problem statement:The Security in WSN has become a challenge because of its inherent limitations of resources imposed on the sensor nodes. Authentication and key management scheme allows WSNs to be used with confidence and maintains integrity of data in sensor networks. Approach: In the WSN limited resource scenario the generation of public key done and are randomly pre distributed while deploying the sensor nodes. Since the sensor nodes are limited by energy it needs to concentrate on fast decryption and verification of message. In order to enable the fast decryption we have proposed a novel method which uses three algorithms hybrid to achieve the increase in decryption speed which in turn reduces the energy used for computation and enhances its performance compared with the existing authentication using classical RSA algorithm. Results: The proposed Enhanced Variant of RSA with CRT using Garner's algorithm to achieve fast decryption speed and provides better performance when compared to the existing RSA. The private key is generated and passed so that the receiver node need not generate it which consumes more computational cost, power and memory at the decryption stage. Also we have done the signing and verification which avoids the message spoofing attack and enable message confidentiality. Further the ERSACRT is designed to counter measure to few attacks possible on RSA. We implemented the ERSACRT in java and tested for system parameters like memory, time, speed and efficiency and compared with that of RSA. Conclusion/Recommendation: The proposed algorithm ERSACRT is efficient and secured along with improved counter measures for secured communication in WSN with reduced energy and computational time.

show abstract

Sensor node compromise detection

Cited by 52 publications

References 7 publications

Discovering Flaws in IDS Through Analysis of Their Inputs

Discovering Flaws in IDS Through Analysis of Their Inputs

Re-authentication in Wireless Sensor Network

Enhanced RSACRT for Energy Efficient Authentication to Wireless Sensor Networks Security

Contact Info

Product

Resources

About