MIMO Wiretap Channels With Arbitrarily Varying Eavesdropper Channel States
In this paper, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wiretap channel in the sense of strong secrecy is derived, and shown to match with the converse in secure degrees of freedom. It is proved that there exists a universal coding scheme that secures the confidential message against any sequence of channel states experienced by the eavesdropper.