Abstract: Feldman showed that the problem of making a linear network coding secure was equivalent to the problem of finding a linear code with certain generalized distance properties, while a security hole was detected in Feldman secure network coding model, if there was any receiving node which betrayed the secure matrix M, then this model would completely lose security meaning. Aimed the defect of this model, this paper presents a new secure network coding model which is suit to the network of high security and low bandwidth. This new model encrypts information with random k, by changing the coding method of information with one-time pad, at the same time the random k is transmitted through the secure channel of secure matrix M. Analysis shows that this new model not only can resist the nodes’ traitorous attack, but also can improve content confidentiality. This new model has these characters: the ability to resist traffic analysis; the ability to resist the nodes’ traitorous attack; stronger content confidentiality.

Key words: secure network coding, secure matrix, one-time pad, performance analysis

摘要： Feldman等人提出，网络编码满足安全性等价于找到满足一定广义矩阵的线性码。分析发现该模型存在一个严重的安全漏洞，即任意接收节点泄露了矩阵M给窃听者，该网络就失去了安全意义。针对模型的缺陷，提出了一种在低带宽下，对安全性要求高的安全网络编码模型。即结合一次一密，改变源输入信息的编码方式，用随机密钥k对原始信息进行加密，利用原来传输矩阵M的安全通道来传输随机密钥k的同时不必牺牲少量的整体容量。分析表明，该模型不仅能够抵抗节点的叛变攻击，内容保密性也得到了进一步提高，模型具有抵抗流量攻击能力，抵抗节点叛变攻击能力以及内容保密性较高等特点。

关键词: 安全网络编码, 安全矩阵, 一次一密, 性能分析