Secure Capacity of Wireless Broadcast Networks
This paper gives a constructive characterization for the capacity of wireless broadcast networks that are prone to Byzantine attacks. The adversary controls a single node in the network and can modify the packets flowing through the node. The central trade-off in such a scenario is that of security and throughput. This paper defines secure capacity as the highest possible transmission rate from the source such that the destination can detect any modification in the information packets. Prior work in this direction mainly concentrate on nodes performing random network coding, where the capacity is shown to be bounded by C −z0, where C is the minimum cut between the source and the destination and z0 is the maximum number of packets the adversary can modify.