Secure Degrees of Freedom of One-hop Wireless Networks
Jianwei Xie, Sennur Ulukus

TL;DR
This paper analyzes the secure degrees of freedom in various one-hop wireless networks, revealing exact values using interference alignment and cooperative jamming, and extends results to multiple helpers and complex network structures.
Contribution
It provides exact secure d.o.f. characterizations for multiple Gaussian network models, introducing new bounds and achievable schemes based on interference alignment and cooperative jamming.
Findings
Secure d.o.f. of wiretap channel with helper is 1/2.
Secure d.o.f. with M helpers is M/(M+1).
Sum secure d.o.f. for broadcast, interference, and multiple access channels are 1, 2/3, and K(K-1)/(K(K-1)+1).
Abstract
We study the secure degrees of freedom (d.o.f.) of one-hop wireless networks by considering four fundamental Gaussian network structures: wiretap channel, broadcast channel with confidential messages, interference channel with confidential messages, and multiple access wiretap channel. The secure d.o.f. of the canonical Gaussian wiretap channel with no helpers is zero. It has been known that a strictly positive secure d.o.f. can be obtained in the Gaussian wiretap channel by using a helper which sends structured cooperative signals. We show that the exact secure d.o.f. of the Gaussian wiretap channel with a helper is 1/2. Our achievable scheme is based on real interference alignment and cooperative jamming, which renders the message signal and the cooperative jamming signal separable at the legitimate receiver, but aligns them perfectly at the eavesdropper preventing any reliable…
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.
