网络编码对等网络中抵御拜占庭攻击的研究
On Counteracting Byzantine Attacks in Network Coded Peer-to-Peer Networks
摘要：
随机线性网络编码可以用于对等网络中，以提高内容分发和分布式存储的效率。然而，这些系统特别容易受到拜占庭攻击。我们量化的影响拜占庭攻击的编码系统，通过评估的概率，接收器节点无法正确地恢复一个文件。我们表明，即使是一个小概率的攻击，系统失败的压倒性的概率。然后，我们提出了一种新的签名方案，允许数据包级拜占庭检测。该方案允许一跳遏制污染，并通过允许节点检测和丢弃污染的数据包来节省带宽。我们比较了我们的签名方案与其他各种拜占庭方案的净成本，并表明，当拜占庭攻击的概率是高的，我们的方案是最有效的带宽。
英文摘要：
Random linear network coding can be used in peer-to-peer networks to increase the efficiency of content distribution and distributed storage. However, these systems are particularly susceptible to Byzantine attacks. We quantify the impact of Byzantine attacks on the coded system by evaluating the probability that a receiver node fails to correctly recover a file. We show that even for a small probability of attack, the system fails with overwhelming probability. We then propose a novel signature scheme that allows packet-level Byzantine detection. This scheme allows one-hop containment of the contamination, and saves bandwidth by allowing nodes to detect and drop the contaminated packets. We compare the net cost of our signature scheme with various other Byzantine schemes, and show that when the probability of Byzantine attacks is high, our scheme is the most bandwidth efficient.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
