期刊文献+

基于CRC的防污染网络编码方案 被引量:1

Pollution-Resistant Network Coding Based on CRC
下载PDF
导出
摘要 网络编码的直接应用容易遭受污染攻击,我们针对这一安全性问题,给出了一种基于CRC校验码的防污染网络编码方案.该方案首先通过引入快速的并行CRC校验码和消息时间戳的设计理念,然后结合具有同态性质的RSA签名算法,来确保校验码和时间戳的安全.从该方案的安全性方面和效率方面进行分析表明:网络编码、并行逆序CRC检验码和消息时间戳三者的结合可以有效地抵抗污染攻击和重放攻击,并且大大地降低节点的计算代价,提高了网络的吞吐量. The direct application of network coding is vulnerable to pollution attack. In order to solve this security problem, we propose a network coding scheme to prevent it from pollution based on CRC check code. First, this protocol employs a fast parallel CRC check code and message timestamp to effectively resist pollution attack and replay attack. Secondly, by combining with the homomorphic properties of RSA signature algorithm, we ensure the security of CRC and timestamp. Security analysis and efficiency analysis show that applying network coding, parallel CRC check code and message timestamp together can greatly reduce the computational cost of the node and improve the network throughput.
出处 《计算机系统应用》 2016年第1期101-106,共6页 Computer Systems & Applications
基金 国家自然科学基金(61072080) 福建省高校产学合作科技重大项目(2011H6008) 福建省2013年战略性新兴产业技术开发项目(闽发改高技[2013]266号)
关键词 网络编码 污染攻击 并行CRC校验码 时间戳 network coding pollution attacks parallel CRC check code timestamp
  • 相关文献

参考文献15

  • 1Ahlswede R, Cai N, Li SYR, et al. Network information flow. IEEE Trans. on Information Theory, 2000, 46(4):1204-1216.
  • 2Krohn MN, Freedman MJ, Mazieres D. On-the-fly verification of rateless erasure codes for efficient content distribution. Proc. 2004 IEEE Symposium on Security and Privacy. IEEE. 2004. 226-240.
  • 3蒋铭勋,崔巍.随机线性网络编码污染数据的检测分析[J].计算机工程,2010,36(24):107-109. 被引量:4
  • 4Yu Z, Wei Y, Ramkumar B, et al. An efficient signature-based scheme for securing network coding against pollution attacks. Proc. of the 27th IEEE Conference on Computer Communications(INFOCOM). Phoenix, AZ, US. IEEE Press. April 13-18, 2008. 1409-1417.
  • 5Yu Z, Wei Y, Ramkumar B, et al. An efficient scheme for securing XOR network coding against pollution attacks. Proc. of IEEE INFOCOM. Rio de Janeiro, Brazil. IEEE Press. April 19-25, 2009. 406-414.
  • 6Yun A, Cheon JH, Kim Y. Brief contributions on homomorphic signatures for network coding. IEEE Trans. on Computers, 2010, 59(9):1295-1296.
  • 7Liu GJ, Wang B. Secure network coding against Intra/Inter-generation pollution attacks. China Communications, 2013, 10(8):100-110.
  • 8Liu J, Liu C, Liu H, et al. Pollution resistance network coding research for Ad hoc network. Proc. of International Conference on Computer Science and Information Technology. Springer India. 2014. 261-268.
  • 9Zhang P, Jiang Y, Lin C, et al. Padding for orthogonality:efficient subspace authentication for network coding. Proc. of IEEE INFOCOM. Shanghai, China. IEEE Press. April 10-15, 2011. 1026-1034.
  • 10周赵斌,许力,李世唐,罗晓晴.一种抗窃听和污染攻击的网络编码方案[J].福建师范大学学报(自然科学版),2014,30(2):42-48. 被引量:1

二级参考文献93

  • 1林闯,彭雪海.可信网络研究[J].计算机学报,2005,28(5):751-758. 被引量:253
  • 2贾春福,钟安鸣,周霞,田然,段雪涛.基于系统调用的Linux系统入侵检测技术研究[J].计算机应用研究,2007,24(4):147-150. 被引量:7
  • 3Gkantsidis C, Rodriguez P R. Cooperative Security for Network Coding File Distribution[C]//Proc. of INFOCOM'06. [S. l.]: IEEE Press, 2006.
  • 4Zbao Fang, Kalker T, M6dard M, et al. Signatures for Content Distribution with Network Coding[C]//Proc. of ISIT'07. Paris, France: [s. n.], 2007.
  • 5Elias K, Baochun L. Null Keys: Limiting Malicious Attacks via Null Space Properties of Network Coding[C]//Proc. of INFOCOM'09. [S. l.]: IEEE Press, 2009.
  • 6Boneh D, Freeman D. Signing a Linear Subspace: Signature Schemes for Network Coding[C]//Proc. of PKC'09. [S. l.]: IEEE Press, 2009.
  • 7U.S. Department of Commerce. Digital Signature Standard[S]. 2000.
  • 8Cohen B, The BitTorrent Protocol Specification[EB/OL]. (2004- 12-12). http ://www.bittorrent.org/.
  • 9STINSONDR.密码学原理与实践[M].3版.冯登国,译.北京:电子工业出版社,2009.
  • 10Ahlswede R, Cai N, Li S Y R, et al. Network information flow [J]. IEEE Trans on Information Theory, 2000, 46 (4): 1204- 1216.

共引文献21

同被引文献3

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部