科研之友
微信
新浪微博
Facebook
分享链接
摘要
In the practical network coding scenario, the adversary usually has full eavesdropping abilities. Hence, lightweight secure network coding is more suitable than the information-theoretic approach. We propose a novel coding scheme against a global eavesdropper in this paper. In our scheme, we utilize r mapping values to randomize original packets instead of r locked coefficients. It means that only one encrypted symbol is required for a packet, which rapidly reduces space overhead and encryption volume. Meanwhile, there is no additional requirement at intermediate nodes. Compared to the existing schemes, our scheme is more efficient in space overhead and encryption volume with appropriate computational complexity.
- 出版日期2012
- 单位西安电子科技大学
