窃昕攻击下子空间码的安全性-计算机科学.PDFVIP

第 44 卷第6A 期 Vo l. 44 No. 6A 计算机科学 2017 年 6 月 CO岛1PUTER SCIENCE June 2017 窃昕攻击下子空间码的安全性 刘宴请1 王雪冰2 (渤海大学工学院 锦州 121000)1 (中国石油大学胜利学院 东营 25706 1) 2 摘 要 子空间码与随机线性网络编码相结合的网络系统具有编译码复杂度低、元需附加编码矢量和非相干通信等 优点，曾被用于网络纠错。针对子空间码在窃听攻击下的安全性能，将攻击者猜测信源消息的成功概率作为子空间码 的安全性度量。基于 Cai 和 Yeung 提出的网络窃听模型，采用线性代数和组合学方法，定量计算了攻击者的猜测概率 并得到了闭式解。分析结果表明，子空间码具有概率意义下的弱安全性，但与许多完美安全或弱安全编码方案相比， 子空间码具有复杂度低、灵活性高、拓扑不受限、可对抗多边窃听等优势，因此子空间码适用于计算受限且安全性能要 求不高的应用。 关键词 网络安全，窃听攻击，子空间码 中固法分类号 TP393 文献标识码 A Security of Subspace Code against Wiretap Attacks LIU Yan-tao 1 WANG Xue-bing2 (College of Engineeri吨，Bohai University ,]inzhou 121000 ,China)1 (Shengli College ,China University of Petroleum ,Ixmgying 257061 ,China)2 Abstract The network system in combination of subspace code and random linear network coding has the advantages of low complexity of encoding and decoding , there is no need to attach coding vectors , and noncoherent communications , and it has been applied for network error correcting. This paper addressed the security of subspace code against wiretap attacks. The security perforτn且nce is measured in the probability with which the attacker guesses source messages. Based on the wiretap network model proposed by Cai and Yeung ,we quantitatively calculated the guess probability with the methods of linear algebra and combinatorics and obtained its closed form solution. The result shows that subspace code has weak security in the sense of probability. Compared to many co