Scalable Security in Interference Channels With Arbitrary Number of Users

Parisa Babaheidarian; Somayeh Salimi; Panagiotis Papadimitratos

Summary

2020

Session Number:C02

Session:

Number:C02-3

Scalable Security in Interference Channels With Arbitrary Number of Users

Parisa Babaheidarian, Somayeh Salimi, Panagiotis Papadimitratos,

pp.402-406

Publication Date:2020/10/18

Online ISSN:2188-5079

DOI:10.34385/proc.65.C02-3

PDF download

Summary:

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 should remain ignorant regarding
messages intended for other receivers. Our scheme relies on
transmitters to collectively ensure the confidentiality of the
transmitted messages using a cooperative jamming technique
and lattice alignment. The Asymmetric compute-and-forward
framework is used to perform the decoding operation. The
proposed scheme 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 and thus the achievable rates
lie within constant gap from sum secure capacity.