防窃听和防污染的安全网络编码研究

发布时间：2018-11-18 07:39

【摘要】：随着网络编码的应用越来越广泛，网络编码中的安全问题也成为研究热点之一。安全问题包括窃听问题和污染问题。论文针对网络编码中存在的窃听问题和污染问题进行研究，构造出有效的安全网络编码算法。论文所有的研究均在单源多播网络中进行。本文首先构造一种防窃听的弱安全网络编码算法，该算法基于范德蒙矩阵和哈希函数。信源用哈希函数构造范德蒙矩阵，用范德蒙矩阵变换信源信息。经证明其在确定性网络编码中能获得弱安全要求，且不限制窃听者的窃听能力。当把此算法应用于随机网络编码中，在窃听者不知道哈希函数时能保证算法以概率1达到弱安全要求。在秘密链路模型下，算法编码速率可达到网络多播容量。针对窃听攻击，基于密码学，本文构造一种防窃听的信息论安全网络编码算法。在使用确定性线性网络编码时，证明其可达到信息论安全的条件。在秘密链路模型中，对该算法进行了改进，使其可达到网络最大多播容量。在窃听者计算能力有限的条件下，，改进算法在使用随机网络编码时也能达到信息论安全。针对污染攻击，本文还给出一种新的防污染攻击的安全网络编码算法，该算法基于同态哈希函数和Diffie-Hellman密钥交换协议，经证明该算法能有效地抵抗网络中的污染问题。该算法在信宿端进行签名认证，中间节点只负责对收到的签名进行计算并向下转发。最后用仿真实验验证了上述性能。
[Abstract]:With the increasing application of network coding, the security problem in network coding has become one of the research hotspots. Security concerns include wiretapping and pollution. In this paper, the problem of eavesdropping and pollution in network coding is studied, and an effective secure network coding algorithm is constructed. All the researches in this paper are carried out in single-source multicast networks. In this paper, we first construct a weak security network coding algorithm based on van der Mon matrix and hash function. The source uses hash function to construct the van der Mon matrix, and the Vandermonde matrix is used to transform the source information. It has been proved that it can obtain weak security requirements in deterministic network coding and does not limit the eavesdropping ability of eavesdroppers. When the algorithm is applied to random network coding, it can ensure that the algorithm meets the requirement of weak security with probability 1 when the eavesdropper does not know the hash function. In the secret link model, the coding rate of the algorithm can reach the network multicast capacity. For eavesdropping attacks, based on cryptography, this paper constructs an information theory secure network coding algorithm for eavesdropping. In the use of deterministic linear network coding, it is proved that it can meet the requirements of information theory security. In the secret link model, the algorithm is improved to achieve the maximum multicast capacity. Under the condition that the eavesdropper's computing power is limited, the improved algorithm can also achieve information theory security when using random network coding. In this paper, a new secure network coding algorithm for pollution attack is presented. The algorithm is based on homomorphic hash function and Diffie-Hellman key exchange protocol. It has been proved that the algorithm can effectively resist the pollution problem in the network. The algorithm authenticates the signature at the destination, and the intermediate node is only responsible for calculating the received signature and forwarding it downwards. Finally, the performance is verified by simulation experiments.
【学位授予单位】：南京邮电大学
【学位级别】：硕士
【学位授予年份】：2014
【分类号】：TN915.08

【相似文献】