Secure Degrees of Freedom of One-hop Wireless Networks

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 decoding of the message signal. Our converse is based on two key lemmas. The first lemma quantifies the secrecy penalty by showing that the net effect of an eavesdropper on the system is that it eliminates one of the independent channel inputs. The second lemma quantifies the role of a helper by developing a direct relationship between the cooperative jamming signal of a helper and the message rate. We extend this result to the case of M helpers, and show that the exact secure d.o.f. in this case is M/(M+1). We then generalize this approach to more general network structures with multiple messages. We show that the sum secure d.o.f. of the Gaussian broadcast channel with confidential messages and M helpers is 1, the sum secure d.o.f. of the two-user interference channel with confidential messages is 2/3, the sum secure d.o.f. of the two-user interference channel with confidential messages and M helpers is 1, and the sum secure d.o.f. of the K-user multiple access wiretap channel is K(K-1)/(K(K-1)+1).