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

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