Secure Degrees of Freedom of One-hop Wireless Networks with No Eavesdropper CSIT∗

Pritam Mukherjee, Jianwei Xie, Şennur Ulukuş

Published Jan 1, 2015• 35 citations

Abstract

We consider three channel models: the wiretap channel withM helpers, the K-user multiple access wiretap channel, and the K-user interference channel with an external eavesdropper, when no eavesdropper's channel state information (CSI) is available at the transmitters. In each case, we establish the optimal sum secure degrees of free-dom (s.d.o.f.) by providing achievable schemes and matching converses. We show that the unavailability of the eavesdropper's CSIT does not reduce the s.d.o.f. of the wiretap channel with helpers. However, there is loss in s.d.o.f. for both the multiple access wiretap channel and the interference channel with an external eavesdropper. In particular, we show that in the absence of eavesdropper's CSIT, the K-user multiple access wiretap channel reduces to a wiretap channel with (K − 1) helpers from a sum s.d.o.f. perspective, and the optimal sum s.d.o.f. reduces from K(K−1)K(K−1)+1 to K−1 K. For the interference channel with an external eavesdropper, the optimal sum s.d.o.f. de-creases from K(K−1)2K−1 to K−1 2 in the absence of the eavesdropper's CSIT. Our results show that the lack of eavesdropper's CSIT does not have a signicant impact on the optimal s.d.o.f. for any of the three channel models, especially when the number of users is large. This implies that physical layer security can be made robust to the unavailability of eavesdropper CSIT at high signal to noise ratio (SNR) regimes by careful modication of the achievable schemes as demonstrated in this paper. 1

Related papers

Secure Degrees of Freedom of One-Hop Wireless Networks With No Eavesdropper CSIT

Pritam Mukherjee, Jianwei Xie, Şennur Ulukuş

We consider three channel models: the wiretap channel with M helpers, the K-user multiple access wiretap channel, and the K-user interference channel with an external eavesdropper, when no eavesdropper's channel state information (CSI) is available at the transmitters. In each case, we establish the optimal sum secure degrees of freedom (s.d.o.f.) by providing achievable schemes and matching converses. We show that the unavailability of the eavesdropper's channel state information at the transmitter (CSIT) does not reduce the s.d.o.f. of the wiretap channel with helpers. However, there is loss in s.d.o.f. for both the multiple access wiretap channel and the interference channel with an external eavesdropper. In particular, we show that in the absence of eavesdropper's CSIT, the K-user multiple access wiretap channel reduces to a wiretap channel with (K - 1) helpers from a sum s.d.o.f. perspective, and the optimal sum s.d.o.f. reduces from K(K-1) /K(K-1)+1 to K-1 K . For the interference channel with an external eavesdropper, the optimal sum s.d.o.f. decreases from K(K-1) /2K-1 to K-1/ 2 in the absence of the eavesdropper's CSIT. Our results show that the lack of eavesdropper's CSIT does not have a significant impact on the optimal s.d.o.f. for any of the three channel models, especially when the number of users is large. This implies that physical layer security can be made robust to the unavailability of eavesdropper CSIT at high signal-to-noise ratio regimes by the careful modification of the achievable schemes as demonstrated in this paper.

arXiv:1506.06114IEEE Transactions on Information TheoryOct 19, 201632 citations

Secrecy in MIMO Networks with No Eavesdropper CSIT

Pritam Mukherjee, Şennur Ulukuş

We consider two fundamental multi-user channel models: the multiple-input multiple-output (MIMO) wiretap channel with one helper (WTH) and the MIMO multiple access wiretap (MAC-WT) channel. In each case, the eavesdropper has K antennas while the remaining terminals have N antennas each. We consider a fast fading channel where the channel state information (CSI) of the legitimate receiver is available at the transmitters but no CSI at the transmitters (CSIT) is available for the eavesdropper's channel. We determine the optimal sum secure degrees of freedom (s.d.o.f.) for each channel model for the regime K ≤ N, and show that in this regime, the MAC-WT channel reduces to the WTH in the absence of eavesdropper CSIT. For the regime N ≤ K ≤ 2N, we obtain the optimal linear s.d.o.f., and show that the MAC-WT channel and the WTH have the same optimal s.d.o.f. when restricted to linear encoding strategies. In the absence of any such restrictions, we provide an upper bound for the sum s.d.o.f. of the MAC-WT channel in the regime N ≤ K ≤ 2N. Our results show that unlike in the single-input single-output case, there is loss of s.d.o.f. for even the WTH due to lack of eavesdropper CSIT when K ≥ N.

arXiv:1610.03475IEEE Transactions on CommunicationsJan 1, 201712 citations

Secure degrees of freedom of the interference channel with no eavesdropper CSI

Pritam Mukherjee, Şennur Ulukuş

We consider the K-user interference channel with an external eavesdropper, with no eavesdropper's channel state information at the transmitters (CSIT). We determine the exact sum secure degrees of freedom (s.d.o.f.) for this channel by providing a new alignment based achievable scheme and a matching converse. Our results show that the lack of eavesdropper's CSIT does not have a significant impact on the optimal s.d.o.f. of the interference channel with an external eavesdropper, especially when the number of users is large.

IEEE Information Theory Workshop (ITW)Oct 1, 20151 citation

Secure degrees of freedom of the multiple access wiretap channel with no eavesdropper CSI

Pritam Mukherjee, Şennur Ulukuş

We consider the K-user Gaussian multiple access wiretap channel (MAC-WT), where no eavesdropper channel state information (CSI) is available at the transmitters. We show that the exact sum secure degrees of freedom (s.d.o.f.) of this channel model is K-1/K . This result shows that, under the condition of no eavesdropper CSI, the MAC-WT acts like a single-transmitter K - 1 helper wiretap channel. We further show that, when a subset of the transmitters have eavesdropper CSI, then higher sum s.d.o.f. can be achieved, and the system can be operated as a MAC-WT for the users with eavesdropper CSI, with the remaining users acting as helpers. In particular, if m of the K transmitters have eavesdropper CSI, we show that m(K-1)/m(K-1)+1 sum s.d.o.f. can be achieved, showing the benefits of having the eavesdropper CSI at the transmitters.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 201510 citations

MIMO one hop networks with no eve CSIT

Pritam Mukherjee, Şennur Ulukuş

Two fundamental multi-user channel models: the multiple-input multiple-output (MIMO) wiretap channel with one helper (WTH) and the MIMO multiple access wiretap channel (MAC-WT) are considered. In each case, the eavesdropper has K antennas while the remaining terminals have N antennas. We consider a fast fading channel where the channel state information (CSI) of the legitimate receiver is available at the transmitters but no channel state information at the transmitters (CSIT) is available for the eavesdropper's channel. The optimal sum secure degrees of freedom (s.d.o.f.) for each channel model is determined for the regime K ≤ N, and we show that in this regime, the MAC-WT channel reduces to the WTH in the absence of eavesdropper CSIT. For the regime N ≤ K ≤ 2N, we obtain the optimal linear s.d.o.f., and show that the MAC-WT channel and the WTH have the same optimal s.d.o.f. when restricted to linear encoding strategies. In the absence of any such restrictions, we provide an upper bound for the sum s.d.o.f. of the MAC-WT chanel in the regime N ≤ K ≤ 2N. Our results show that unlike in the single-input single-output (SISO) case, there is loss of s.d.o.f. for even the WTH due to lack of eavesdropper CSIT, when K ≥ N.

Allerton Conference on Communication, Control, and ComputingSep 1, 20166 citations

Secure Degrees of Freedom of One-Hop Wireless Networks

Jianwei Xie, Şennur Ulukuş

We study the secure degrees of freedom (d.o.f.) of one-hop wireless networks by considering four fundamental wireless network structures: 1) Gaussian wiretap channel; 2) Gaussian broadcast channel with confidential messages; 3) Gaussian interference channel with confidential messages; and 4) Gaussian multiple access wiretap channel. The secrecy capacity of the canonical Gaussian wiretap channel does not scale with the transmit power, and hence, the secure d.o.f. of the 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 twouser 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.

arXiv:1209.5370IEEE Transactions on Information TheoryApr 4, 2014136 citations