基于SpaceMac的网络编码污染攻击协同防御
Cooperative Defense against Pollution Attacks in Network Coding Using SpaceMac
摘要：
已知会话内网络编码易受污染攻击。在这项工作中，首先，我们引入了一种新的同态MAC方案称为SpaceMac，它允许一个中间结点，以验证其接收到的数据包是否属于一个特定的子空间，即使子空间随着时间的推移而扩大。然后，我们使用SpaceMac作为一个积木设计一个合作计划，提供完整的防御污染攻击：（i）它可以检测污染的数据包早在中间结点和（ii）它可以确定的确切位置的所有，甚至串通，攻击者，从而有可能消除它们。我们的计划是合作的：任何节点的父节点和子节点协作，以检测由该节点发送的任何被破坏的分组，并且网络中的节点与中央控制器协作，以识别所有攻击者的确切位置。我们在C/C++和Java中实现了SpaceMac作为一个库，我们使库在线可用。我们在PC和Android设备上的评估表明，（i）SpaceMac的算法可以快速有效地计算，（ii）我们的合作防御计划具有较低的计算和显着降低通信开销比其他可比的国家的最先进的计划。
英文摘要：
Intra-session network coding is known to be vulnerable to pollution attacks. In this work, first, we introduce a novel homomorphic MAC scheme called SpaceMac, which allows an intermediate node to verify if its received packets belong to a specific subspace, even if the subspace is expanding over time. Then, we use SpaceMac as a building block to design a cooperative scheme that provides complete defense against pollution attacks: (i) it can detect polluted packets early at intermediate nodes and (ii) it can identify the exact location of all, even colluding, attackers, thus making it possible to eliminate them. Our scheme is cooperative: parents and children of any node cooperate to detect any corrupted packets sent by the node, and nodes in the network cooperate with a central controller to identify the exact location of all attackers. We implement SpaceMac in both C/C++ and Java as a library, and we make the library available online. Our evaluation on both a PC and an Android device shows that (i) SpaceMac's algorithms can be computed quickly and efficiently, and (ii) our cooperative defense scheme has low computation and significantly lower communication overhead than other comparable state-of-the-art schemes.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
