[show abstract][hide abstract] ABSTRACT: This paper considers the problem of Alter design with secrecy constraints, where two legitimate parties, Alice and Bob, communicate in the presence of an eavesdropper, Eve, over multiple-input multiple-output (MIMO) Gaussian channels. In particular, we consider the design of transmit and receive filters that minimize the mean-squared error (MSE) between the legitimate parties subject to a certain eavesdropper MSE level, in the situation where the eavesdropper MIMO channel is a degraded version of the main MIMO channel. We characterize the form of the optimal receive filters as well as the form of optimal transmit filter in different scenarios. We also put forth an iterative algorithm to obtain the optimal values of the transmit and receive filters. Finally, we present a set of numerical results that illustrate the conclusions.
[show abstract][hide abstract] ABSTRACT: We consider the MIMO wiretap channel, that is a MIMO broadcast channel where the transmitter sends some confidential information to one user which is a legitimate receiver, while the other user is an eavesdropper. Perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that the eavesdropper gets zero bits of information. In this paper, we compute the perfect secrecy capacity of the multiple antenna MIMO broadcast channel, where the number of antennas is arbitrary for both the transmitter and the two receivers. Our technique involves a careful study of a Sato-like upper bound via the solution of a certain algebraic Riccati equation.
IEEE Transactions on Information Theory 09/2011; · 2.62 Impact Factor
[show abstract][hide abstract] ABSTRACT: Wyner's results for discrete memoryless wire-tap channels are extended to the Gaussian wire-tap channel. It is shown that the secrecy capacity Cs is the difference between the capacities of the main and wire.tap channels. It is further shown that Rd= Cs is the upper boundary of the achievable rate-equivocation region.
IEEE Transactions on Information Theory 08/1978; · 2.62 Impact Factor
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.