Towards Scalable Security in Interference Channels With Arbitrary Number of Users

TL;DR

This paper introduces a scalable security scheme for interference channels with any number of users, combining advanced coding and jamming techniques to achieve near-optimal secure rates at finite SNR.

Contribution

It presents the first asymptotically optimal secure scheme for arbitrary users in interference channels, scalable to any finite SNR, without external helpers.

Findings

Achieves individual secure rates scaling with log(SNR).

Sum secure rates within constant gap of capacity.

Attains sum secure degrees of freedom of 1.

Abstract

In this paper, we present an achievable security scheme for an interference channel with arbitrary number of users. In this model, each receiver should be able to decode its intended message while it cannot decode any meaningful information regarding messages intended for other receivers. Our scheme achieves individual secure rates which scale linearly with log(SNR) and achieves sum secure rates which is within constant gap of sum secure capacity. To design the encoders at the transmitters side, we combine nested lattice coding, random i.i.d. codes, and cooperative jamming techniques. Asymmetric compute-and-forward framework is used to perform the decoding operation at the receivers. The novelty of our scheme is that it is the first asymptotically optimal achievable scheme for this security scenario which scales to arbitrary number of users and works for any finite-valued SNR. Also, our scheme achieves the upper bound sum secure degrees of freedom of $1$ without using external helpers.