Scalable Security in Interference Channels with Arbitrary Number of Users

• 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 ontransmitters 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.

Ämnesord

TEKNIK OCH TEKNOLOGIER  -- Elektroteknik och elektronik -- Telekommunikation (hsv//swe)

ENGINEERING AND TECHNOLOGY  -- Electrical Engineering, Electronic Engineering, Information Engineering -- Telecommunications (hsv//eng)

Nyckelord

Decoding

Degrees of freedom (mechanics)

Signal to noise ratio

Arbitrary number

Asymptotically optimal

Compute and forwards

Cooperative jamming

Interference channels

Scalable securities

Security scheme

Upper Bound

Signal interference

Publikations- och innehållstyp

ref (ämneskategori)

kon (ämneskategori)