Weakly Secure Network Coding for Wireless Cooperative Data Exchange
The authors consider the problem of secure cooperative data exchange in wireless networks. The cooperative data exchange problem includes a set of wireless clients that exchange information over a lossless broadcast channel. The clients are missing some packets but collectively know all packets. Each client can transmit packets it currently has or a combination thereof. The problem asks for a scheme that allows all clients to recover all packets with the minimum number of transmissions. They focus on secure information exchange in the presence of an eavesdropper that can observe all packets transmitted over the channel. Their goal is to construct a weakly secure solution to the cooperative data exchange problem, i.e., a solution that does not reveal information about any single packet.