收藏本站
《中国通信》 2015年06期
收藏 | 投稿 | 手机打开
二维码
手机客户端打开本文

Low-Complexity Secure Network Coding Against Wiretapping Using Intra/Inter-generation Coding

LIU Guangjun  LIU Binyue  LIU Ximeng  LI Fang  GUO Wangmei  
【摘要】:Existing solutions against wiretapping attacks for network coding either bring significant bandwidth overhead or incur a high computational complexity.In order to reduce the security overhead of the existing solutions for securing network coding,a novel securing network coding paradigm is presented relying on two coding models:intra-generation coding and inter-generation coding.The basic idea to secure network coding using intra-generation coding is to limit the encryption operations for each generation,and then subject the scrambled and the remaining original source vectors to a linear transformation.This method is then generalized seamlessly using inter-generation coding by further exploiting the algebraic structure of network coding.We show that the proposed schemes have properties of low-complexity security,little bandwidth consumption,and high efficiency in integrating with the existing security techniques effectively.

知网文化
【参考文献】
中国期刊全文数据库 前2条
1 ;CoP: An Ultra-Lightweight Secure Network Coding Scheme via Last Forwarder's Proof[J];Tsinghua Science and Technology;2012年05期
2 熊轲;樊平毅;易粟;雷鸣;;中继蜂窝网络下行协作网络编码中继方法(英文)[J];中国通信;2013年07期
【共引文献】
中国期刊全文数据库 前3条
1 LIN FuHong;LIU Qian;ZHOU XianWei;XIONG Ke;;Towards green for relay in InterPlaNetary Internet based on differential game model[J];Science China(Information Sciences);2014年04期
2 杜冠瑶;熊轲;裘正定;;基于能量收集的协作中继传输性能[J];吉林大学学报(工学版);2015年03期
3 宁兆龙;宋清洋;郭磊;代梦凡;岳明宏;;下一代无线网络中基于动态区域扩展的干扰协调研究方案(英文)[J];中国通信;2014年05期
【二级参考文献】
中国期刊全文数据库 前1条
1 覃团发;罗建中;唐振华;刘家锋;;一种基于网络编码协作的高能效无线传感器网络机制(英文)[J];中国通信;2011年02期
【相似文献】
中国期刊全文数据库 前10条
1 黄骏,朱涛;An Efficient Computational Method for Solving Nonlinear Matrix Equation and Its Application in Queuing Analysis[J];Journal of Computer Science and Technology;1996年03期
2 孙昱东;谢志良;;Macro-Dataflow Computational Model and Its Simulation[J];Journal of Computer Science and Technology;1990年03期
3 XIE Wen-jun;HUANG Shan-guo;ZHAO Yong-li;LIU Xin;GU Wan-yi;;Selection of PCEs' location in multi-domain optical networks[J];The Journal of China Universities of Posts and Telecommunications;2013年06期
4 ;Handover Mechanism in Coordinated Multi-Point Transmission/Reception System[J];ZTE Communications;2010年01期
5 王伟平;王建新;;Design and analysis of two-layer anonymous communication system[J];Journal of Central South University of Technology;2007年03期
6 Chen-Jen Yang;Chun-Lung Hsu;;C-Testable Motion Estimation Design for Video Coding Systems[J];Journal of Electronic Science and Technology of China;2009年04期
7 Itsuro Morita;Hidenori Takahashi;Takehiro Tsuritani;;Greater than 200 Gb/s Transmission Using Direct-Detection Optical OFDM Superchannel[J];ZTE Communications;2012年01期
8 ;LogGPO:An accurate communication model for performance prediction of MPI programs[J];Science in China(Series F:Information Sciences);2009年10期
9 黄河燕;;A Parallel Implementation Model of HPARLOG[J];Journal of Computer Science and Technology;1986年04期
10 ;A MULTICAST KEY MANAGEMENT SCHEME BASED ON CHARACTERISTIC VALUES OF MEMBERS[J];Journal of Electronics(China);2012年Z2期
中国重要会议论文全文数据库 前5条
1 ;SIDAM Protocal to Achieve Anonymous Communication in Ad Hoc Networks[A];2008通信理论与技术新发展——第十三届全国青年通信学术会议论文集(下)[C];2008年
2 Lorenzo DiGregorio;Ulf Nordqvist;;Efficient Multithreaded ASIP for Protocol Processing in Access Networks[A];2005中国通信集成电路技术与应用研讨会论文集[C];2005年
3 ;Macro Block Byte Boundary Ending Error Detection Method for Error Concealment[A];第一届建立和谐人机环境联合学术会议(HHME2005)论文集[C];2005年
4 Peng Li;Jian Tang;;Adaptive Particle Filter with Estimation Windows[A];2013年中国智能自动化学术会议论文集(第一分册)[C];2013年
5 LIN Wei;ZHANG Yan-yuan;LI Zhan-huai;;Data Storage Framework on Flash Memory using Object-based Storage Model[A];Proceedings of 2011 International Conference on Computer Science and Information Technology(ICCSIT 2011)[C];2011年
中国硕士学位论文全文数据库 前1条
1 Danish Khan(达呢西);GIL与架空线路的比较及GIL替代架空线路的可行性分析[D];华北电力大学;2014年
 快捷付款方式  订购知网充值卡  订购热线  帮助中心
  • 400-819-9993
  • 010-62791813
  • 010-62985026