MIMO Wiretap Channels With Unknown and Varying Eavesdropper Channel States

IEEE Transactions on Information Theory(2014)

引用 57|浏览15
暂无评分
摘要
In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel state is completely unknown to the legitimate parties. In particular, a Gaussian MIMO wiretap channel is considered, where the eavesdropper channel state can vary from one channel use to the next, and the overall channel state sequence is known only to the eavesdropper. When the eavesdropper has fewer antennas than the transmitter and its intended receiver, a positive secrecy rate in the sense of strong secrecy is proved to be achievable and shown to match with the converse in secure degrees of freedom. This yields the conclusion that secure communication is possible regardless of the location or channel states of the eavesdropper. Additionally, it is observed that, the present setting renders the secrecy capacity problems for some multiterminal wiretap-type channels more tractable as compared to the case with full or partial knowledge of eavesdropper channel states. To demonstrate this observation, secure degrees of freedom regions are derived for the Gaussian MIMO multiple access (MAC) wiretap channel and the two-user Gaussian MIMO broadcast (BC) wiretap channel, where the transmitter(s) and intended receiver(s) have the same number of antennas.
更多
查看译文
关键词
Gaussian MIMO multiple access wiretap channel,multiterminal wiretap-type channels,Information theoretic secrecy,Gaussian channels,eavesdropper channel state,positive secrecy rate,strong secrecy,information theoretic secrecy problems,MIMO wiretap channel,MIMO BC wiretap channel,MIMO MAC wiretap channel,wireless channels,eavesdroppers with unknown and varying channel gains,secrecy capacity problems,MIMO communication,overall channel state sequence,two-user Gaussian MIMO broadcast wiretap channel
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要