Research On Information Theoretically Secure Caching And Routing Scheme With Network Coding

With the development of the Internet era,data traffic keeps growing rapidly,how to ensure the security and efficiency of data transmission becomes an important challenge.Network coding technology has thoroughly changed the traditional “store and forward” way of data transmission.It has great advantages in optimizing throughput,providing natural data confidentiality,saving network resources,balancing network load,etc.Linear network coding allows nodes in the network to do the encoding and decoding with linear operations on received data packets,because of its simple coding method and low computational complexity,it has been widely studied and applied.In this paper,we have studied the problem of information theoretically secure caching and routing scheme based on linear network coding,to defend against the passive attack in traditional networks and information-centric networks,separately.For traditional networks,we propose the Information Theoretically Secure Multiple Multicasts(ITSMM)problem,with the following objectives:(1)maximizing the secure transmission rate,(2)minimizing the random symbol rate,(3)minimizing the bandwidth cost.We have proved that the ITSMM problem is equivalent to a network flow problem with constraints on intermediate nodes and proposed the optimal flow allocation algorithm based on linear programmings.Besides,extensive simulations have been conducted to verify the performance of the proposed algorithm.For information-centric networks,we propose the Secure Content Caching and Routing(SCCR)problem,with the following objectives:(1)minimizing the total cost of cache and bandwidth consumption,(2)minimizing the random symbol rate.To solve this problem,we have first proposed a secure content caching and routing scheme based on software defined networks.Then,we have proposed the optimal secure cache management and routing algorithm based on linear programmings.The simulation results show that the proposed algorithms can provide data confidentiality,improve network throughput and save network resources.Therefore,this research has great significance to the future research of secure multicast in traditional networks as well as the secure content cache management and routing in information-centric networks.