Secure Network Coding Theory And Its Applications Based On Trust Centre

Network coding is an essential breakthrough in the field of information transmission and processing theoretical study. Network coding encodes the received information before processing, it is differ from intermediate nodes, which are only copy and transfer the information packets. Network coding theory involves computer networks, multicast technology, multi-user information theory, graph theory and so on. It is very useful to improve network throughput, security and robustness.Network coding have many advantages, but the network coding system is easy to suffering from eavesdropping attack (passive attacks) and Byzantine attack (active attacks), which are pollution attacks. Network coding allows the nodes to encode the received packets before transferring them out. So it has a big problem that if a node is corrupted, the error in this node will cause the downstream nodes received the wrong data packets, which called the spread of contamination. Nowadays, we need security and efficient data communication urgently, so how to solution of pollution attacks problems in network coding application is bound to increase more essential.The works in this paper is focus on the secure network coding theory, and present a secure network coding against pollution attacks based on Trust Centre (TC-SNCAPA). The main works are as follows:(1) Analysis the eavesdropping attack in network coding, we present The Weakly Secure Network Coding Model Base on Global Encoding Kernel Encryption. This model is designed through using weakly secure network coding and neural network integrated with chaos-based encryption technology. So it can make source and targets exchange their key in a safe and efficient way, and make sure security transmission the global encoding kernel. Data simulation shows that the model has a little increase in energy consumption, it achieve to has a sharp improvement on protecting weakly security network against eavesdropping with a small cost on the energy consumption.(2) Considering the Byzantine attacks in network coding, we present Identification and Signature Scheme for Network Coding Based on ECC Theory. This model is designed through using Trust Centre (TC) and ECC homomorphism hashing. We assume that the finite-energy trans-nodes verify the integrity, and an infinite-energy Trusted Center (TC) which links the entire trans-nodes stably verifies the consistency. And it can decrease the energy consumption in network significantly.(3) Considering the energy consumption in verify the integrity, we present Optimization Model Based on BER (Bit Error Rate) Gate. We design this model for the reason that not BER in each input channel is the same, so we can verify the data from the channels which has a higher BER than BER gate only, and assume the data from the channels which has a lower BER than BER gate is right. This model designs the calculation method of BER gate through research on the relationship between the BER rate and verification times. Theoretical derivation and data simulation shows that the model has a dramatic decrease in energy consumption.The above research contents TC-SNCAPA against the pollution attack in limited energy consumption. This is a safe and efficient model.