Efficient weakly secure network coding scheme against node conspiracy attack based on network segmentation
TL;DR: This paper considers the problem of building a secure network against node conspiracy attack that based on network segmentation and topology design and proposes a weakly secure scheme that can efficiently prevent conspiracy attack.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Hidden Connectivity in Networks with Vulnerable Classes of Nodes
TL;DR: Sebastian M. Krause, Michael M. Danziger, and Vinko Zlatić Theoretical Physics Division, Rudjer Bošković Institute, Bijenicka c.
23
Security against passive attacks on network coding system – A survey
Yantao Liu,Yasser Morgan +1 more
TL;DR: A comprehensive review of the researches on secure network coding against passive attack, establishing a security hierarchy with four grades for network coding systems and suggesting several open problems and promising methods for the future study.
18
Optimal redundancy against disjoint vulnerabilities in networks
TL;DR: The results reveal a new layer of hidden structure in complex systems and can enhance security and robustness through optimal redundancy in a wide range of systems including biological, economic and communications networks.
13
A Review in Recent Development of Network Threats and Security Measures
Roza Dastres,Mohsen Soori +1 more
- 02 Feb 2021
TL;DR: A review in recent development of network threats and security measures is presented, different attacks to the networks and security measured against them are discussed in order to increase security in the web of data.
References
Network information flow
TL;DR: This work reveals that it is in general not optimal to regard the information to be multicast as a "fluid" which can simply be routed or replicated, and by employing coding at the nodes, which the work refers to as network coding, bandwidth can in general be saved.
9.3K
Linear network coding
TL;DR: This work forms this multicast problem and proves that linear coding suffices to achieve the optimum, which is the max-flow from the source to each receiving node.
An algebraic approach to network coding
Ralf Koetter,Muriel Medard +1 more
TL;DR: For the multicast setup it is proved that there exist coding strategies that provide maximally robust networks and that do not require adaptation of the network interior to the failure pattern in question.
An algebraic approach to network coding
Ralf Koetter,Muriel Medard +1 more
- 24 Jun 2001
TL;DR: The question whether a set of desired connections can be accommodated in a network to the problem of finding a point on a variety defined over a suitable field lends itself to the derivation of a number of theorems concerning the feasibility of a communication scenario involving failures.
Secure network coding
Ning Cai,Raymond W. Yeung +1 more
- 30 Jun 2002
TL;DR: This paper proposes a new model which incorporates network coding and information security, and presents a construction of secure linear network codes provided a certain graph-theoretic sufficient condition is satisfied.
624