دانلود رایگان مقاله طراحی بهینه شبکه برنامه نویسی امن در برابر حمله استراق سمع

Abstract

In this paper, we study the optimal design of weakly secure linear network coding (WSLNC) against wiretapping attack. Specifically, given a set of wiretapped links, we investigate how to maximize the weakly secure transmission rate of multiple unicast streams between a pair of source and destination nodes, and how to minimize the size of the required finite field, over which the WSLNC can be implemented. In our study, we apply a novel approach that integrates the WSLNC design and the transmission topology construction. We first provide theoretical analysis and prove that the problem of finding the optimal transmission topology is NP-hard. We then develop efficient algorithms to find optimal and sub-optimal topologies in different scenarios. With the transmission topology, we design WSLNC schemes and theoretically analyze the relationships between the transmission topology and two important system factors: (1) the size of the finite field, and (2) the probability that a random linear network coding is weakly secure. Based on the relationships, we further improve our algorithms to address the two system factors, while keeping the same maximal STR. Extensive simulation results show that the proposed heuristic algorithms can achieve good performance in various scenarios.

8. Conclusion

In this paper, we have investigated the optimal design of weakly secure NC under wiretapping attack, where we focused on the scenario that there are multiple unicast streams between the same source and destination nodes. Our objectives include (1) maximizing the STR under the weakly secure requirement, and (2) minimizing the size of the finite field, on which the weakly secure NC is defined. To address the issue, we have applied a novel approach that integrates weakly secure NC design with transmission topology construction. In particular, we first defined the problem and analyzed its behaviors, including the characteristics of an optimal transmission topology, the maximal STR, and the NP-hardness of the problem. Based on the understandings of the problem, we developed an optimal algorithm that is practically solvable when the capacity between the source and destination nodes is small, and we developed two efficient heuristic algorithms for general case to achieve the above two objectives. We then devised deterministic and random coding schemes that can achieve the maximal STR, given a transmission topology, where we also studied the relationship between the transmission topology and two major system factors: (1) the size of the finite field, and (2) the probability of a random code is weakly secure. Then, another heuristic algorithm is developed for the transmission topology which can reduce the size of the finite field and increase the probability of a random code is weakly secure. Finally, we have conducted extensive simulation experiments and the results show that the the proposed heuristic algorithms achieve good performance in various scenarios.