arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1003.1787cs.ITmath.IT
收藏

基于MRD码的通用安全网络编码抗强攻击的脆弱性

Vulnerability of MRD-Code-based Universal Secure Network Coding against Stronger Eavesdroppers

Eitaro Shioji, Ryutaroh Matsumoto, Tomohiko Uyematsu

摘要:

Silva等人提出了一种基于MRD码的通用安全网络编码方案,该方案可应用于任何底层网络编码。本文考虑了一个更强的窃听模型,窃听者有能力重新选择窃听链路在传输过程中。我们给出了一个证明,不可能实现普遍的安全对这样的对手使用席尔瓦等人。的代码的所有选择的代码参数,甚至与有限数量的点击链接。我们还考虑了有限的窃听时间的情况下,并得出一些条件,这个代码是安全的。

英文摘要:

Silva et al. proposed a universal secure network coding scheme based on MRD codes, which can be applied to any underlying network code. This paper considers a stronger eavesdropping model where the eavesdroppers possess the ability to re-select the tapping links during the transmission. We give a proof for the impossibility of attaining universal security against such adversaries using Silva et al.'s code for all choices of code parameters, even with restricted number of tapped links. We also consider the cases with restricted tapping duration and derive some conditions for this code to be secure.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑