We investigate the secure degrees of freedom (s.d.o.f.) of two new channel models: broadcast channel with combating helpers and interference channel with selfish users. In the first model, over a classical broadcast channel with confidential messages (BCCM), there are two helpers, each associated with one of the receivers. In the second model, over a classical interference channel with confidential messages (ICCM), there is a helper and users are selfish. The goal of introducing these channel models is to investigate various malicious interactions that arise in networks, including active adversaries. By casting each problem as an extensive-form game and applying recursive real interference alignment, we show that, for the first model, the combating intentions of the helpers are neutralized and the full s.d.o.f. is retained; for the second model, selfishness precludes secure communication and no s.d.o.f. is achieved.
['Karim A. Banawan', 'Sennur Ulukus']
Secrecy in broadcast channel with combating helpers and interference channel with selfish users