Secrecy in the 2-User Symmetric Deterministic Interference Channel with Transmitter Cooperation

TL;DR

This paper introduces new achievable schemes for secure communication over a 2-user symmetric deterministic interference channel with limited transmitter cooperation, optimizing secrecy rates across different interference regimes.

Contribution

It proposes novel schemes combining interference cancelation, relaying, time sharing, and random bits, tailored to cooperation rates and interference levels, advancing secure interference channel strategies.

Findings

Achieves capacity without secrecy constraints in weak interference regime.

Sharing random bits enhances secrecy rates in high interference scenarios.

Highlights the role of limited cooperation in secure communications.

Abstract

This work presents novel achievable schemes for the 2-user symmetric linear deterministic interference channel with limited-rate transmitter cooperation and perfect secrecy constraints at the receivers. The proposed achievable scheme consists of a combination of interference cancelation, relaying of the other user's data bits, time sharing, and transmission of random bits, depending on the rate of the cooperative link and the relative strengths of the signal and the interference. The results show, for example, that the proposed scheme achieves the same rate as the capacity without the secrecy constraints, in the initial part of the weak interference regime. Also, sharing random bits through the cooperative link can achieve a higher secrecy rate compared to sharing data bits, in the very high interference regime. The results highlight the importance of limited transmitter cooperation in facilitating secure communications over 2-user interference channels.