Learn More
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(More)
We show that the sum secure degrees of freedom (d.o.f.) of the K-user Gaussian multiple access (MAC) wiretap channel is K(K-1)/K(K-1)+1. Our achievability is based on real interference alignment and structured cooperative jamming. Each user divides its message into K - 1 sub-messages, and sends a linear combination of signals carrying these sub-messages(More)
Wireless communications systems are particularly vulnerable to security attacks because of the inherent openness of the transmission medium. In this article, we focus on guaranteeing confidentiality against eavesdropping attacks where an unauthorized entity aims to intercept an ongoing wireless communication, and we provide a comprehensive summary of recent(More)
We consider three channel models: the wiretap channel with <inline-formula> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula> helpers, the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-user multiple access wiretap channel, and the <inline-formula> <tex-math notation="LaTeX">$K$ </tex-math></inline-formula>-user(More)
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(More)
We consider the Gaussian wiretap channel with M helpers, where no eavesdropper channel state information (CSI) is available at the legitimate entities. The exact secure d.o.f. of the Gaussian wiretap channel with M helpers with perfect CSI at the transmitters was found in [1], [2] to be M/M+1. One of the key ingredients of the optimal achievable scheme in(More)
— We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdrop-per (IC-EE); 2) K-user interference channel with confidential messages (IC-CM); and 3) K-user interference channel with confidential messages(More)
We study the K-user 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 transmitter-receiver pair. Our approach is based on the (real) interference alignment technique.(More)
—In this paper, we study the sum secure degrees of freedom (d.o.f.) of two-unicast layered wireless networks. Without any secrecy constraints, 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, in addition to being(More)
We determine the exact sum secure degrees of freedom (d.o.f.) of the K-user Gaussian interference channel. We consider three different secrecy constraints: 1) K-user interference channel with one external eavesdropper (IC-EE), 2) K-user interference channel with confidential messages (IC-CM), and 3) K-user interference channel with confidential messages and(More)