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.
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.
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.
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.
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.
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.
This dissertation studies physical layer security in wireless networks using an information theoretic framework. The central theme of this work is exploring the effect of delayed or no channel state information (CSI) on physical layer security in various wireless channel models. We begin with the fast Rayleigh fading wiretap channel, over which a legitimate transmitter wishes to have secure communication with a legitimate receiver in the presence of an eavesdropper. Subject to an average power constraint on the input, and with no CSI at any user, we show that the input distribution that achieves the secrecy capacity for this wiretap channel is discrete with a finite number of mass points. This enables us to evaluate the exact secrecy capacity of this channel numerically. Next, we consider multi-user models, specifically, 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 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 CSI 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. We, then, study multiple-input multiple-output (MIMO) multi-user channels. We begin with the case when full CSIT is available. We consider a two-user MIMO multiple access wiretap channel with N antennas at each transmitter, N antennas at the legitimate receiver, and K antennas at the eavesdropper. We determine the optimal sum s.d.o.f. for this model for all values of N and K. We subdivide our problem into several regimes based on the values of N and K, and provide achievable schemes based on real and vector space alignment techniques for fixed and fading channel gains, respectively. To prove the optimality of the achievable schemes, we provide matching converses for each regime. Our results show how the number of eavesdropper antennas affects the optimal sum s.d.o.f. of the multiple access wiretap channel. In line with the theme of this dissertation, we next consider the MIMO wiretap channel with one helper and the two-user MIMO multiple access channel when no eavesdropper CSIT is available. In each case, the eavesdropper has K antennas while the remaining terminals have N antennas. We determine the optimal sum s.d.o.f. for each channel model for the regime K<= N, and we show that in this regime, the multiple access wiretap channel reduces to the wiretap channel with a helper 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 multiple access wiretap channel and the wiretap channel with a helper 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 multiple access wiretap channel 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 wiretap channel with a helper due to lack of eavesdropper CSIT, when K>= N. Finally, we explore the effect of delayed CSIT on physical layer security. In particular, we consider the two user multiple-input single-output (MISO) broadcast channel with confidential messages, in which the nature of CSIT from each user can be of the form I_{i}, i=1,2 where I_{i} belongs to {P, D,N}, and the forms P, D and N correspond to perfect and instantaneous, completely delayed, and no CSIT, respectively. Thus, the overall CSIT can be any of nine possible states corresponding to all possible values of (I_{1},I_{2}). While the optimal sum s.d.o.f. in the homogeneous settings corresponding to I_1=I_2 are already known in the literature, we focus on the heterogeneous settings where I_1 is not equal to I_2 and establish the optimal s.d.o.f. region in each case. We further consider the case where the CSIT state varies with time. Each state (I_1,I_2) can then occur for \lambda_{I_{1}I_{2}} fraction of the total duration. We determine the s.d.o.f. region of the MISO broadcast channel with confidential messages under such an alternating CSIT setting, with a mild symmetry assumption, where \lambda_{I_{1} I_{2}}=\lambda_{I_{2}I_{1}}.
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.