在无线双向通信中基于CRC-NC抵抗污染攻击方案  

A CRC-NC Scheme Against Pollution Attack in Wireless Two-Way Communication

作　　者：罗晓晴[1,2] 李世唐[1,2] 许力[1,2] 

机构地区：[1]福建师范大学数学与计算机科学学院,福州350007 [2]福建省网络安全与密码技术重点实验室,福州350007

出　　处：《信号处理》2014年第11期1357-1362,共6页Journal of Signal Processing

基　　金：福建省自然科学基金项目(2013J01222);福建师范大学"网络与信息安全关键理论和技术"校创新团队(IRTL1207)

摘　　要：本文提出一种在无线双向通信中基于CRC-NC(Cyclic Redundancy Check-Network Coding)抵抗污染攻击方案。在无线双向通信网络中,该方案通过结合网络编码和循环冗余校验码技术,对接收到的消息进行可信度检测,有效地降低目的节点解码差错概率,并抵抗污染攻击。该方案中节点A与节点B在中继节点的辅助下相互发送消息,并利用对方节点和中继节点发送的消息解码。若节点直接从对方节点获得的消息中有S个消息正确,该节点将对方节点发送的消息和中继节点发送的消息进行组合,并计算组合消息的汉明重量,从中选择K-S个最小的汉明重量所对应的由中继节点发送的消息解码。通过仿真结果表明,与基于随机选取方案和加密方案相比,该方案能有效的降低节点解码差错概率。We propose a CRC-NC（Cyclic Redundancy Check-Network Coding） scheme against pollution attack that exploit network coding and cyclic redundancy check code approach to detect the trustworthiness of the packets and decrease the probability of decoding error in the presence of pollution attack in the wireless two-way communication. In this paper,two nodes send packets to each other with the assistance of a relay node,and one node decoding packets which received from the other node and the relay. If S packets are correctly received from the other node directly,then K- S packets for which the Hamming weight are smallest are selected from all combination packets＇ Hamming weight for decoding. We show that the CRC-NC scheme provides a significantly lower probability of decoding error than the random selection scheme and cryptographic scheme that require computational and bandwidth overheads.

关 键 词：网络编码 污染攻击 循环冗余校验编码 汉明重量 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]