TY - GEN
T1 - MIMO broadcast channel with arbitrarily varying eavesdropper channel
T2 - 54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
AU - He, Xiang
AU - Khisti, Ashish
AU - Yener, Aylin
N1 - Copyright:
Copyright 2012 Elsevier B.V., All rights reserved.
PY - 2011
Y1 - 2011
N2 - A two-receiver MIMO broadcast-wiretap channel is considered where the channel state of the eavesdropper is arbitrarily varying. It is assumed that the eavesdropper knows this channel state perfectly whereas the legitimate nodes have no knowledge of it. It is further assumed that the eavesdropper experiences no additive noise. The channel between the transmitter and the two legitimate receivers is a constant MIMO Gaussian broadcast channel. This paper establishes the secrecy degrees of freedom region for transmitting a common-confidential message as well as a private- confidential message to each receiver. It is observed that a straightforward extension of single user random binning does not achieve the optimal secrecy degrees of freedom (s.d.o.f.) region. The proposed coding scheme that achieves the s.d.o.f. region involves simultaneous diagonalization of the channel matrices of the two legitimate receivers using the generalized singular value decomposition (GSVD) as well as a particular structured binning across codebooks that minimizes the rate of the fictitious message. While the focus is on achieving weak secrecy for ease of exposition, an outline is provided on how the results can be extended for achieving strong secrecy.
AB - A two-receiver MIMO broadcast-wiretap channel is considered where the channel state of the eavesdropper is arbitrarily varying. It is assumed that the eavesdropper knows this channel state perfectly whereas the legitimate nodes have no knowledge of it. It is further assumed that the eavesdropper experiences no additive noise. The channel between the transmitter and the two legitimate receivers is a constant MIMO Gaussian broadcast channel. This paper establishes the secrecy degrees of freedom region for transmitting a common-confidential message as well as a private- confidential message to each receiver. It is observed that a straightforward extension of single user random binning does not achieve the optimal secrecy degrees of freedom (s.d.o.f.) region. The proposed coding scheme that achieves the s.d.o.f. region involves simultaneous diagonalization of the channel matrices of the two legitimate receivers using the generalized singular value decomposition (GSVD) as well as a particular structured binning across codebooks that minimizes the rate of the fictitious message. While the focus is on achieving weak secrecy for ease of exposition, an outline is provided on how the results can be extended for achieving strong secrecy.
UR - http://www.scopus.com/inward/record.url?scp=84863410145&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84863410145&partnerID=8YFLogxK
U2 - 10.1109/GLOCOM.2011.6134247
DO - 10.1109/GLOCOM.2011.6134247
M3 - Conference contribution
AN - SCOPUS:84863410145
SN - 9781424492688
T3 - GLOBECOM - IEEE Global Telecommunications Conference
BT - 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
Y2 - 5 December 2011 through 9 December 2011
ER -