Efficient weakly secure network coding scheme against node conspiracy attack based on network segmentation

Rong Du,Jian Li,Shenghong Li,Chenglin Zhao

doi:10.1186/1687-1499-2014-5

Abstract

In this paper, we consider the problem of building a secure network against node conspiracy attack that based on network segmentation. As we know, network coding has demonstrated its great application prospects in wireless sensor network (WSN) transmission. At the same time, it is facing a variety of security threats, especially conspiracy attack. In existing research, secure coding design strategies are much more than secure topological structure. In this background, a weakly secure scheme is proposed from the perspective of topology and network segmentation. Based on the network segmentation and topology design, the network coding transmission is weakly secure. We conduct a simulation to show that the proposed scheme can efficiently prevent conspiracy attack.

Highlights

In 2003, Li [1] demonstrated that with a finite field size, the maximum flow from the single source to sinks can be achieved by linear network coding [2,3]
In [22], the sibling work of this paper, we analyzed how the topology design influenced the security of networks, and we proposed a secure strategy against node conspiracy attack by topology design
In [22], we proposed a secure strategy against node conspiracy attack by topology design (ISTD)

Summary

Introduction

In 2003, Li [1] demonstrated that with a finite field size, the maximum flow from the single source to sinks can be achieved by linear network coding [2,3]. Based on this theory, network coding technology, network coding has demonstrated its great application prospects in both wired networks and wireless networks. It can be separated into two groups in previous, Shannon secure and weakly secure. We focus on the weakly secure topological structure

Objectives

Discussion

Conclusion