Secure decentralized data transfer against node capture attacks for wireless sensor networks

Kohno, Eitaro; Ohta, Yuichi; Kakuda, Yoshiaki

doi:10.1109/isads.2009.5207366

Cited by 27 publications

(9 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…3(b) shows the transmitted shares between a source node and a destination node with multiple paths A, B, and C. In this way, the original data can be transferred securely [3]. The secure dispersed data transfer method utilizes "light-weight" calculations such as the secret sharing scheme (the polynomial-based threshold scheme), and Lagrange's interpolation method (equations (2) and (3)). As a result, the secure dispersed data transfer method can be applied to devices with limited computational power.…”

Section: Outline Of the Secure Dispersed Data Transfer Methodsmentioning

confidence: 99%

See 1 more Smart Citation

A Countermeasure to Eavesdropping on Data Packets by Utilizing Control Packet Overhearing for Radio overlapping Reduced Multipath Routing in Ad Hoc Networks

Murakami

Kohno

Kakuda

2016

IJNC

Self Cite

View full text Add to dashboard Cite

Ad hoc networks are autonomously distributed wireless networks which consist of wireless terminals (hereinafter, referred to as nodes). They do not rely on wireless network infrastructures such as base stations. Relaying nodes and their surrounding nodes are susceptible to data theft and eavesdropping because nodes communicate via radio waves. Previously, we had proposed the secure dispersed data transfer method for encryption, decryption, and transfer of the original data packets. To use the secure dispersed data transfer method securely, we had proposed using the node-disjoint multipath routing method. In this method, multiple versions of encrypted data packets are transferred along each disjoint multipath to counter data packet theft. We had also proposed the enhanced version of the aforementioned routing method to reduce radio area overlap by using rebroadcasting of control packets to counter eavesdropping attacks. In this paper, we propose a multipath routing method to reduce radio area overlap through the introduction of control packet overhearing. We introduce control packet overhearing mechanisms to eliminate excess control packet counts and latency in the pathfinding process. Our main contributions are as follows: (1) our proposed method can reduce radio area overlap without each node's geographical location information (e.g., using GPS information); (2) our proposed method also can eliminate excess control packets and latency without degradation of the security. Furthermore we conducted simulation experiments to evaluate our proposed method. We observed that our proposed method can construct the desired paths with a smaller amount of control packets and a shorter latency in the pathfinding process. We also conducted additional experiments to discuss the applicable scope of our proposed method. As a result, we confirmed that our proposed method was more effective as the average number of adjacent nodes increased.

show abstract

Section: Outline Of the Secure Dispersed Data Transfer Methodsmentioning

confidence: 99%

“…Furthermore, they face the problem of keys being stolen or revoked. To counter this, the secure dispersed data transfer method has been proposed [2] [3] [4].…”

Section: Introductionmentioning

confidence: 99%

A Countermeasure to Eavesdropping on Data Packets by Utilizing Control Packet Overhearing for Radio overlapping Reduced Multipath Routing in Ad Hoc Networks

Murakami

Kohno

Kakuda

2016

IJNC

Self Cite

View full text Add to dashboard Cite

show abstract

“…In [14], the authors proposed a new distribution method resilient against node capture attacks that utilizes the Secret Sharing Scheme (SSS) [15][16][17].…”

Section: Related Workmentioning

confidence: 99%

“…6 (2017) [ Fig. 1] Assumptions of secure decentralized data transfer against node capture attacks [14].…”

Section: 보안공학연구논문지 Journal Of Security Engineeringmentioning

confidence: 99%

Non-blocking Network Structure based Dynamic Multi-Path Routing for Dispersed Data Transmission Improvement against Node Capture Attacks in Wireless Sensor Network

Lim¹,

Kim²

2017

JSE

View full text Add to dashboard Cite

In WSNs, the sensor nodes with the sensing, data processing, and communicating components are randomly deployed in the terrain of difficult access. They have to send the important sensing data to the sink by wireless links. However, their battery life time is limited. During the communication for the sensing data transmission, several kinds of attacks may occur. The node capture attacks are one prospective a kind of attacks. The key based several secure algorithms have been proposed for attack prevention. In case of the node capture attacks, when a node is captured in symmetric key based and asymmetric key based systems, attackers can get the key and the data. To resolve this problem, we propose a dynamic multi-path routing for important data protection and security from node capture attacks. We use the basic algorithm of baseline network structure in order to establish a dynamic multi-path for the secure transmission of sensing data. We compare the results of two metrics between dynamic multi-path and single-path methods by a relay node capture attack and prove the effectiveness of our approach through the simulation experiments.

show abstract

“…Since, in ad hoc networks, data packets are forwarded by multi-hop transmission, they are susceptible to attacks. As we described in [3] [4], SRIDR can be used for the secure dispersed data transfer method [5] [6], i.e., security related method. Along with dynamic address routing (DART) [7] and its extensions, ATR and M-DART, [8] [9], SRIDR employs binary tree-structured routing ID that indicates a parent-child-based node's adjacency.…”

Section: Introductionmentioning

confidence: 99%

On the Applicability of the Tree-Based Group ID Reassignment Routing Method for MANETs

Yanagimoto

Kohno

Kakuda

2014

2014 IEEE 11th Intl Conf on Ubiquitous Intelligence and Computing and 2014 IEEE 11th Intl Conf on Autonomic and Trusted Computi

Self Cite

View full text Add to dashboard Cite

Previously, we had proposed the source initiated routing ID-based routing (SRIDR) method that utilized "topdown" tree-structured routing ID to counter the disruption due to the instability of wireless communication for static ad hoc networks. Since this method has no ID reassignment process, this method cannot be applied to MANETs. To counter link disruption due to node mobility, we have proposed a new treebased "bottom-up" group ID assignment and reassignment routing method for MANETs. In the previous paper, we only confirmed the data packet delivery ratio at specific parameters. To discuss applicability of the method to MANETs, we have to determine the effectiveness of the method on varied parameters that are related to MANETs. In this paper, we show the results of our previously proposed method on the varied parameters of node mobility, node density, and bandwidth in MANETs.

show abstract

Secure decentralized data transfer against node capture attacks for wireless sensor networks

Cited by 27 publications

References 20 publications

A Countermeasure to Eavesdropping on Data Packets by Utilizing Control Packet Overhearing for Radio overlapping Reduced Multipath Routing in Ad Hoc Networks

A Countermeasure to Eavesdropping on Data Packets by Utilizing Control Packet Overhearing for Radio overlapping Reduced Multipath Routing in Ad Hoc Networks

Non-blocking Network Structure based Dynamic Multi-Path Routing for Dispersed Data Transmission Improvement against Node Capture Attacks in Wireless Sensor Network

On the Applicability of the Tree-Based Group ID Reassignment Routing Method for MANETs

Contact Info

Product

Resources

About