Security Challenges in Network Coding : The case of the Diversity Problem

概要

論文の詳細を見る
Network Coding is a routing algorithm, where relay nodes are allowed to treat incoming packets as vectors and output linear combinations of them. As a result, networks can increase throughput in multicast scenarios and become more tolerant against non-byzantine failures. However, byzantine adversaries can perform attacks that reduce network performance, one of this attacks is the recently introduced "Diversity Attack", where a relay node does not code from all its incoming packets. In this paper we present a solution to the diversity problem that is independent of the size of the actual payload of messages, the solution is based on the use of Threshold Cryptography consensus about the behavior of a node into a single checking operation. To further reduce the overhead of the system, we extend the solution to include a probabilistic alternative that is more efficient in terms of overhead.
一般社団法人電子情報通信学会の論文
2013-02-20