Secure Degrees of Freedom Regions of Multiple Access and Interference Channels: The Polytope Structure
Jianwei Xie, Sennur Ulukus

TL;DR
This paper characterizes the entire secure degrees of freedom regions for K-user Gaussian multiple access and interference channels with secrecy constraints, revealing the polytope structure and explicit schemes to achieve all extreme points.
Contribution
It provides the full s.d.o.f. region characterization for these channels, including the polytope structure and explicit schemes for achieving all extreme points.
Findings
The s.d.o.f. regions form polytopes with explicit extreme points.
Achievability schemes are constructed using cooperative jamming and structured signaling.
The sum s.d.o.f. is achieved only at the symmetric-rate extreme point.
Abstract
The sum secure degrees of freedom (s.d.o.f.) of two fundamental multi-user network structures, the K-user Gaussian multiple access (MAC) wiretap channel and the K-user interference channel (IC) with secrecy constraints, have been determined recently as K(K-1)/(K(K-1)+1) [1,2] and K(K-1)/(2K-1) [3,4], respectively. In this paper, we determine the entire s.d.o.f. regions of these two channel models. The converse for the MAC follows from a middle step in the converse of [1,2]. The converse for the IC includes constraints both due to secrecy as well as due to interference. Although the portion of the region close to the optimum sum s.d.o.f. point is governed by the upper bounds due to secrecy constraints, the other portions of the region are governed by the upper bounds due to interference constraints. Different from the existing literature, in order to fully understand the characterization…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
