Results 1  10
of
21
Interference alignment for the multiantenna compound wiretap channel
 IEEE Trans. Inform. Theory
, 2011
"... All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately. ..."
Abstract

Cited by 27 (3 self)
 Add to MetaCart
All intext references underlined in blue are linked to publications on ResearchGate, letting you access and read them immediately.
Secure Degrees of Freedom of the Gaussian Wiretap Channel with Helpers
"... Abstract — 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 cha ..."
Abstract

Cited by 22 (16 self)
 Add to MetaCart
(Show Context)
Abstract — 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. Our achievable scheme is based on 2 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
Secure Degrees of Freedom of Onehop Wireless Networks
, 2012
"... We study the secure degrees of freedom (d.o.f.) of onehop wireless networks by considering four fundamental wireless network structures: Gaussian wiretap channel, Gaussian broadcast channel with confidential messages, Gaussian interference channel with confidential messages, and Gaussian multiple a ..."
Abstract

Cited by 19 (12 self)
 Add to MetaCart
(Show Context)
We study the secure degrees of freedom (d.o.f.) of onehop wireless networks by considering four fundamental wireless network structures: Gaussian wiretap channel, Gaussian broadcast channel with confidential messages, Gaussian interference channel with confidential messages, and 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 twouser interference channel with confidential messages and M helpers is 1, and the sum secure d.o.f. of the Kuser multiple access wiretap channel is
Real interference alignment for the Kuser Gaussian interference compound wiretap channel
 In 48th Annual Allerton Conference on Communication, Control and Computing
, 2010
"... Abstract — We study the Kuser Gaussian interference wiretap channel with N external eavesdroppers. All the transmitters, receivers and eavesdroppers have a single antenna each. We propose an achievable scheme to lower bound the secure degrees of freedom (d.o.f.) for each transmitterreceiver pair. ..."
Abstract

Cited by 11 (10 self)
 Add to MetaCart
Abstract — We study the Kuser Gaussian interference wiretap channel with N external eavesdroppers. All the transmitters, receivers and eavesdroppers have a single antenna each. We propose an achievable scheme to lower bound the secure degrees of freedom (d.o.f.) for each transmitterreceiver pair. Our approach is based on the (real) interference alignment technique. Our achievable scheme not only aligns the interference at each receiver to prevent the d.o.f. from vanishing, but also aligns the signals observed by the eavesdroppers to reduce the secrecy penalty. The achievable secure d.o.f. of each transmitterreceiver pair is shown to be 1 2 channel gains.
Secure Broadcasting Using Multiple Antennas
"... Abstract: We consider three different secure broadcasting scenarios: i) Broadcast channels with common and confidential messages (BCC), ii) multireceiver wiretap channels with public and confidential messages, and iii) compound wiretap channels. The BCC is a broadcast channel with two users, where ..."
Abstract

Cited by 7 (6 self)
 Add to MetaCart
(Show Context)
Abstract: We consider three different secure broadcasting scenarios: i) Broadcast channels with common and confidential messages (BCC), ii) multireceiver wiretap channels with public and confidential messages, and iii) compound wiretap channels. The BCC is a broadcast channel with two users, where in addition to the common message sent to both users, a private message, which needs to be kept hidden as much as possible from the other user, is sent to each user. In this model, each user treats the other user as an eavesdropper. The multireceiver wiretap channel is a broadcast channel with two legitimate users and an external eavesdropper, where the transmitter sends a pair of public and confidential messages to each legitimate user. Although there is no secrecy concern about the public messages, the confidential messages need to be kept perfectly secret from the eavesdropper. The compound wiretap channel is a compound broadcast channel with a group of legitimate users and a group of eavesdroppers. In this model, the transmitter sends a common confidential message to the legitimate users, and this confidential message needs to be kept perfectly secret from all eavesdroppers. In this paper, we provide a survey of the existing informationtheoretic results for these three forms of secure broadcasting problems, with a closer look at the Gaussian multipleinput multipleoutput (MIMO) channel models. We also present the existing results for the more general discrete memoryless channel models, as they are often the first step in obtaining the capacity results for the corresponding Gaussian MIMO channel models. Index Terms: Broadcast channels, information theoretic security, multiple antennas.
On the Sum Secure Degrees of Freedom of TwoUnicast Layered Wireless Networks
"... Abstract—In this paper, we study the sum secure degrees of freedom (d.o.f.) of twounicast layered wireless networks. Without a secrecy constraint, the sum d.o.f. of this class of networks was studied by [1] and shown to take only one of three possible values: 1, 3/2 and 2, for all network configura ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
(Show Context)
Abstract—In this paper, we study the sum secure degrees of freedom (d.o.f.) of twounicast layered wireless networks. Without a secrecy constraint, the sum d.o.f. of this class of networks was studied by [1] and shown to take only one of three possible values: 1, 3/2 and 2, for all network configurations. We consider the setting where the message of each sourcedestination pair must be kept informationtheoretically secure from the unintended receiver. We show that the sum secure d.o.f. can take 0, 1, 3/2, 2 and at most countably many other positive values, which we enumerate. s1 u1 u2 u3 t1 t2 s2 w1 w2 w3
On Gaussian MIMO Compound Wiretap Channels
"... Abstract — We study the twouser oneeavesdropper discrete memoryless compound wiretap channel, where the transmitter sends a common confidential message to both users, which needs to be kept perfectly secret from the eavesdropper. We provide a new achievable secrecy rate which is shown to be potent ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
Abstract — We study the twouser oneeavesdropper discrete memoryless compound wiretap channel, where the transmitter sends a common confidential message to both users, which needs to be kept perfectly secret from the eavesdropper. We provide a new achievable secrecy rate which is shown to be potentially better than the best known lower bound for the secrecy capacity of this compound wiretap channel. We next consider the twouser oneeavesdropper Gaussian multipleinput multipleoutput (MIMO) compound wiretap channel. We obtain an achievable secrecy rate for the Gaussian MIMO compound wiretap channel by using dirtypaper coding (DPC) in the achievable scheme we provided for the discrete memoryless case. We show that the corresponding achievable secrecy rate achieves at least half of the secrecy capacity of the twouser oneeavesdropper Gaussian MIMO wiretap channel. We also obtain the secrecy capacity of the twouser oneeavesdropper Gaussian MIMO compound wiretap channel when the eavesdropper is degraded with respect to one of the two users. I.
Secure Degrees of Freedom of KUser Gaussian Interference Channels: A Unified View
, 2013
"... We determine the exact sum secure degrees of freedom (d.o.f.) of the Kuser Gaussian interference channel. We consider three different secrecy constraints: 1) Kuser interference channel with one external eavesdropper (ICEE), 2) Kuser interference channel with confidential messages (ICCM), and 3) ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
We determine the exact sum secure degrees of freedom (d.o.f.) of the Kuser Gaussian interference channel. We consider three different secrecy constraints: 1) Kuser interference channel with one external eavesdropper (ICEE), 2) Kuser interference channel with confidential messages (ICCM), and 3) Kuser interference channel with confidential messages and one external eavesdropper (ICCMEE). We show that for all of these three cases, the exact sum secure d.o.f. is K(K−1) 2K−1. We show converses for ICEE and ICCM, which imply a converse for ICCMEE. We show achievability for ICCMEE, which implies achievability for ICEE and ICCM. We develop the converses by relating the channel inputs of interfering users to the reliable rates of the interfered users, and by quantifying the secrecy penalty in terms of the eavesdroppers’ observations. Our achievability uses structured signaling, structured cooperative jamming, channel prefixing, and asymptotic real interference alignment. While the traditional interference alignment provides some amount of secrecy by mixing unintended signals in a smaller subspace at every receiver, in order to attain the optimum sum secure d.o.f., we incorporate structured cooperative jamming into the achievable scheme, and intricately design the structure of all of the transmitted signals jointly.
Secrecy Capacity Region of the Degraded Compound Multireceiver Wiretap Channel
"... Abstract—We study the degraded compound multireceiver wiretap channel, which consists of two groups of users and a group of eavesdroppers. We consider two different communication scenarios. In both scenarios, the transmitter sends two confidential messages, one for each group of users. In the first ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract—We study the degraded compound multireceiver wiretap channel, which consists of two groups of users and a group of eavesdroppers. We consider two different communication scenarios. In both scenarios, the transmitter sends two confidential messages, one for each group of users. In the first scenario, both messages need to be kept confidential from the eavesdroppers. For this scenario, we assume that there is only one eavesdropper. We obtain the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian multiinput multioutput (MIMO) channel model, we obtain the secrecy capacity region when there is only one user in the second group. In the second scenario, the message sent to the first group of users needs to be kept confidential from both the second group of users and eavesdroppers, whereas the message sent to the second group of users needs to be kept confidential only from the eavesdroppers. For this scenario, we do not put any restriction on the number of eavesdroppers. We find the secrecy capacity region for the general discrete memoryless channel model, the parallel channel model, and the Gaussian parallel channel model. For the Gaussian MIMO channel model, we obtain the secrecy capacity region when there is only one user in the second group. I.
A Broadcast Approach for Fading Wiretap Channels. Submitted to
 IEEE Transactions on Information Theory
"... A (layered) broadcast approach is studied for the fading wiretap channel without the channel state information (CSI) at the transmitter. Two broadcast schemes, based on superposition coding and embedded coding respectively, are developed to encode information into a number of layers and use stochast ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
A (layered) broadcast approach is studied for the fading wiretap channel without the channel state information (CSI) at the transmitter. Two broadcast schemes, based on superposition coding and embedded coding respectively, are developed to encode information into a number of layers and use stochastic encoding to keep the corresponding information secret from an eavesdropper. The layers that can be successfully and securely transmitted are determined by the channel states to the legitimate receiver and the eavesdropper. The advantage of these broadcast approaches is that the transmitter does not need to know the CSI to the legitimate receiver and the eavesdropper, but the scheme still adapts to the channel states of the legitimate receiver and the eavesdropper. Three scenarios of block fading wiretap channels with a stringent delay constraint are studied, in which either the legitimate receiver’s channel, the eavesdropper’s channel, or both channels are fading. For each scenario, the secrecy rate that can be achieved via the broadcast approach developed in this paper is derived, and the optimal power allocation over the layers (or the conditions on the optimal power