Constrained Colluding Eavesdroppers: An Information-Theoretic Model
This work addresses security in wireless networks for applications like military or financial communications, but is incremental as it modifies an existing model by adding constraints to collusion.
The paper tackles the problem of secure communication in the presence of eavesdroppers with limited collusion capabilities, deriving achievable secure rates for discrete memoryless and Gaussian channels and comparing them to non-colluding and perfect colluding scenarios.
We study the secrecy capacity in the vicinity of colluding eavesdroppers. Contrary to the perfect collusion assumption in previous works, our new information-theoretic model considers constraints in collusion. We derive the achievable secure rates (lower bounds on the perfect secrecy capacity), both for the discrete memoryless and Gaussian channels. We also compare the proposed rates to the non-colluding and perfect colluding cases.