Secret Sharing over Fast-Fading MIMO Wiretap Channels

Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of a wiretapper who also makes channel observations that are different from but correlated to those made by the destination. An interactive authenticated unrestricted public channel is also available for use by the source and destination in the secret sharing process. This falls under the"channel-type model with wiretapper"considered by Ahlswede and Csiszar. A minor extension of their result (to continuous channel alphabets) is employed to evaluate the key capacity of the fast-fading MIMO wiretap channel. The effects of spatial dimensionality provided by the use of multiple antennas at the source, destination, and wiretapper are then investigated.


Introduction
The wiretap channel considered in the seminal paper [1] is the first example that demonstrates the possibility of secure communications at the physical layer. It is shown in [1] that a source can transmit a message at a positive (secrecy) rate to a destination in such a way that an eavesdropper only gathers information at a negligible rate, when the source-to-eavesdropper channel is a degraded version of the source-to-destination channel, the source-to-eavesdropper and source-to-destination channels will hereafter be referred to as eavesdropper and destination channels, respectively. A similar result for the Gaussian wiretap channel is provided in [2]. The work in [3] further removes the degraded wiretap channel restriction showing that positive secrecy capacity is possible if the destination channel is "more capable" ("less noisy" for a full extension of the rate region in [1]) than the eavesdropper's channel. Recently, there has been a flurry of interest in extending these early results to more sophisticated channel models, including fading wiretap channels, multiinput multi-output (MIMO) wiretap channels, multipleaccess wiretap channels, broadcast wiretap channels, and relay wiretap channels. We do not attempt to provide a comprehensive summary of all recent developments but highlight only those results that are most relevant to the present work. We refer interested readers to the introduction and reference list of [4] for a concise and extensive overview of recent works.
When the destination and eavesdropper channels experience independent fading, the strict requirement of having a more capable destination channel for positive secrecy capacity can be loosened. This is due to the simple observation that the destination channel may be more capable than the eavesdropper's channel under some fading realizations, even if the destination is not more capable than the eavesdropper on average. Hence, if the channel state information (CSI) of both the destination and eavesdropper channels is available at the source, it is shown in [4,5] that a positive secrecy capacity can be achieved by means of appropriate power control at the source. The key idea is to opportunistically transmit only during those fading realizations for which the destination channel is more capable [6]. For blockergodic fading, it is also shown in [5] (see also [7]) that a positive secrecy capacity can be achieved with a variable-rate transmission scheme without any eavesdropper CSI available at the source.
When the source, destination, and eavesdropper have multiple antennas, the resulting channel is known as a MIMO wiretap channel (see [8][9][10][11][12]), which may also have positive secrecy capacity. Since the MIMO wiretap channel is not degraded, the characterization of its secrecy capacity is not straightforward. For instance, the secrecy capacity of the MIMO wiretap channel is characterized in [9] as the saddle point of a minimax problem, while an alternative characterization based on a recent result for multiantenna broadcast channels is provided in [11]. Interestingly all characterizations point to the fact that the capacity achieving scheme is one that transmits only in the directions in which the destination channel is more capable than the eavesdropper's channel. Obviously, this is only possible when the destination and eavesdropper CSI is available at the source. It is shown in [9] that if the individual channels from antennas to antennas suffer from independent Rayleigh fading, and the respective ratios of the numbers of source and destination antennas to that of eavesdropper antennas are larger than certain fixed values, then the secrecy capacity is positive with probability one when the numbers of source, destination, and eavesdropper antennas become very large.
As discussed above, the availability of destination (and eavesdropper) CSI at the source is an implicit requirement for positive secrecy capacity in the fading and MIMO wiretap channels. Thus, an authenticated feedback channel is needed to send the CSI from the destination back to the source. In [5,7], this feedback channel is assumed to be public, and hence the destination CSI is also available to the eavesdropper. In addition, it is assumed that the eavesdropper knows its own CSI. With the availability of a feedback channel, if the objective of having the source send secret information to the destination is relaxed to distilling a secret key shared between the source and destination, it is shown in [13] that a positive key rate is achievable when the destination and eavesdropper channels are two conditionally independent (given the source input symbols) memoryless binary channels, even if the destination channel is not more capable than the eavesdropper's channel. This notion of secret sharing is formalized in [14] based on the concept of common randomness between the source and destination. Assuming the availability of an interactive, authenticated public channel with unlimited capacity between the source and destination [14] suggests two different system models, called the "source model with wiretapper" (SW) and the "channel model with wiretapper" (CW). The CW model is similar to the (discrete memoryless) wiretap channel model that we have discussed before. The SW model differs in that the random symbols observed at the source, destination, and eavesdropper are realizations of a discrete memoryless source with multiple components. Both SW and CW models have been extended to the case of secret sharing among multiple terminals, with the possibility of some terminals acting as helpers [15][16][17]. Key capacities have been obtained for the two special cases in which the eavesdropper's channel is a degraded version of the destination channel and in which the destination and eavesdropper channels are conditionally independent [13,14]. Similar results have been derived for multiterminal secret sharing [16,17], with the two special cases above subsumed by the more general condition that the terminal symbols form a Markov chain on a tree. Authentication of the public channel can be achieved by the use of an initial short key and then a small portion of the subsequent shared secret message [18]. A detailed study of secret sharing over an unauthenticated public channel is given in [19][20][21].
Other approaches to employ feedback have also been recently considered [22][23][24]. In particular, it is shown in [22] that positive secrecy capacity can be achieved for the modulo-additive discrete memoryless wiretap channel and the modulo-Λ channel if the destination is allowed to send signals back to the source over the same wiretap channel and both terminals can operate in full-duplex manner. In fact, for the former channel, the secrecy capacity is the same as the capacity of such a channel in the absence of the eavesdropper.
In this paper, we consider secret sharing over a fast-fading MIMO wiretap channel. Thus, we are interested in the CW model of [14] with memoryless conditionally independent destination and eavesdropper channels and continuous channel alphabets. We provide an extension of the key capacity result in [14] for this case to include continuous channel alphabets (Theorem 1). Using this result, we obtain the key capacity of the fast-fading MIMO wiretap channel (Section 3). Our result indicates that the key capacity is always positive, no matter how large the channel gain of the eavesdropper's channel is; in addition this holds even if the destination and eavesdropper CSI is available only at the destination and eavesdropper, respectively. Of course, the availability of the public channel implies that the destination CSI could be fed back to the source. However, due to the restrictions imposed on the secret-sharing strategies (see Section 2), only causal feedback is allowed, and thus any destination CSI available at source is "outdated." This does not turn out to be a problem since, unlike the approaches mentioned above, the source does not use the CSI to avoid sending secret information when the destination is not more capable than the eavesdropper's channel. As a matter of fact, the fading process of the destination channel provides a significant part of the common randomness from which the source and the destination distill a secret key. This fact is readily obtained from the alternative achievability proof given in Section 4. We note that [25,26] consider the problem key generation from common randomness over wiretap channels and exploit a Wyner-Ziv coding scheme to limit the amount of information conveyed from the source to the destination via the wiretap channel. Unlike these previous works, we only employ Wyner-Ziv coding to quantize the destination channel outputs. Our code construction still relies on a public channel with unlimited capacity to achieve the key capacity.
Finally, we also investigate the limiting value of the key capacity under three asymptotic scenarios. In the first scenario, the transmission power of the source becomes asymptotically high (Corollary 1). In the second scenario, the destination and eavesdropper have a large number of antennas (Corollary 2). In the third scenario, the gain advantage of the eavesdropper's channel becomes asymptotically large (Corollary 3). These three scenarios reveal two different effects of spatial dimensionality upon key capacity. In the first scenario, we show that the key capacity levels off as the power increases if the eavesdropper has no fewer antennas than the source. On the other hand, when the source has more antennas, the key capacity can increase without bound with the source power. In the second scenario, we show that the spatial dimensionality advantage that the eavesdropper has over the destination has exactly the same effect as the channel gain advantage of the eavesdropper. In the third scenario, we show that the limiting key capacity is positive only if the eavesdropper has fewer antennas than the source. The results in these scenarios confirm that spatial dimensionality can be used to combat the eavesdropper's gain advantage, which was already observed for the MIMO wiretap channel. Perhaps more surprisingly, this is achieved with neither the source nor destination needing any eavesdropper CSI.

Secret Sharing and Key Capacity
We consider the CW model of [14], and we recall its characteristics for completeness. We consider three terminals, namely, a source, a destination, and an eavesdropper. The source sends symbols from an alphabet X. The destination and eavesdropper observe symbols belonging to alphabets Y and Z, respectively. Unlike in [14], X, Y, and Z need not to be discrete. In fact, in Section 3 we will assume that they are multi-dimensional vector spaces over the complex field. The channel from the source to the destination and eavesdropper is assumed memoryless. A generic symbol sent by the source is denoted by X and the corresponding symbols observed by the destination and eavesdropper are denoted by Y and Z, respectively. For notational convenience (and without loss of generality), we assume that (X, Y , Z) are jointly continuous, and the channel is specified by the conditional probability density function (pdf) p Y ,Z|X (y, z | x). In addition, we restrict ourselves to cases in which Y and Z are conditionally independent given X, that is, p Y ,Z|X (y, z | x) = p Y |X (y | x)p Z|X (z | x), which is a reasonable model for symbols broadcast in a wireless medium. Hereafter, we drop the subscripts in pdfs whenever the concerned symbols are well specified by the arguments of the pdfs. We assume that an interactive, authenticated public channel with unlimited capacity is also available for communication between the source and destination. Here, interactive means that the channel is two-way and can be used multiple times, unlimited capacity means that it is noiseless and has infinite capacity, and public and authenticated mean that the eavesdropper can perfectly observe all communications over this channel but cannot tamper with the messages transmitted.
We consider the class of permissible secret-sharing strategies suggested in [14]. Consider k time instants labeled by 1, 2, . . . , k, respectively. The (X, Y , Z) channel is used n times during these k time instants at i 1 < i 2 < · · · < i n . Set i n+1 = k. The public channel is used for the other (k − n) time instants. Before the secret-sharing process starts, the source and destination generate, respectively, independent random variable M X and M Y . To simplify the notation, let a i represent a sequence of messages/symbols a 1 , a 2 , . . . , a i . Then a permissible strategy proceeds as follows.
(i) At time instant 0 < i < i 1 , the source sends message Φ i = Φ i (M X , Ψ i−1 ) to the destination, and the destination sends message to the source. Both transmissions are carried over the public channel.
(ii) At time instant i = i j for j = 1, 2, . . . , n, the source sends the symbol X j = X j (M X , Ψ ij −1 ) to the (X, Y , Z) channel. The destination and eavesdropper observe the corresponding symbols Y j and Z j . There is no message exchange via the public channel, that is, Φ i and Ψ i are both null.
(iii) At time instant i j < i < i j+1 for j = 1, 2, . . . , n, the source sends message Φ i = Φ i (M X , Ψ i−1 ) to the destination, and the destination sends message to the source. Both transmissions are carried over the public channel.
At the end of the k time instants, the source generates its secret key K = K(M X , Ψ k ), and the destination generates its secret key L = L(M Y , Y n , Φ k ), where K and L takes values from the same finite set K.
According to [14], R is an achievable key rate through the channel (X, Y , Z) if for every ε > 0, there exists a permissible secret-sharing strategy of the form described above such that for sufficiently large n. The key capacity of the channel (X, Y , Z) is the largest achievable key rate through the channel. We are interested in finding the key capacity. For the case of continuous channel alphabets considered here, we also add the following power constraint to the symbol sequence X n sent out by the source: with probability one (w.p.1) for sufficiently large n.
Proof. The case with discrete channel alphabets is established in [14, Corollary 2 of Theorem 2], whose achievability proof (also the ones in [16,17]) does not readily extend to continuous channel alphabets. Nevertheless the same single backward message strategy suggested in [14] is still applicable for continuous alphabets. That strategy uses k = n + 1 time instants with i j = j for j = 1, 2, . . . , n. That is, the source first sends n symbols through the (X, Y , Z) channel; after receiving these n symbols, the destination feeds back a single message at the last time instant to the source over the public channel. A carefully structured Wyner-Ziv code can be employed to support this secret-sharing strategy. The detailed arguments are provided in the alternative achievability proof in Section 4.
Here we outline an achievability argument based on the consideration of a conceptual wiretap channel from the destination back to the source and eavesdropper suggested in [13,Theorem 3]. First, assume the source sends a sequence of i.i.d. symbols X n , each distributed according to p(x), over the wiretap channel. Suppose that E[|X| 2 ] ≤ P. Because of the law of large numbers, we can assume that X n satisfies the power constraint (1) without loss of generality. Let Y n and Z n be the observations of the the destinations and eavesdropper, respectively. To transmit a sequence U n of symbols independent of (X n , Y n , Z n ), the destination sends U n + Y n back to the source via the public channel. This creates a conceptual memoryless wiretap channel from the destination with input symbol U to the source in the presence of the eavesdropper, where the source observes (U + Y , X) while the eavesdropper observes (U + Y , Z).
Employing the continuous alphabet extension of the well known result in [3], the secrecy capacity of the conceptual wiretap channel (and hence the key capacity of the original channel) is lower bounded by Note that the input symbol U has no power constraint since the public channel has infinite capacity. But where the third equality results from due to the independence of U and Y , the first inequality follows from the fact which is again due to independence between (Y , Z) and U, and the inequality on the last line follows from Without loss of generality and for notational simplicity, assume that Y and U are both one-dimensional real random variables. Now, choose U to be Gaussian distributed with mean 0 and variance σ 2 U . Then where the first inequality follows from [27, Theorem 8.6.5], and the last equality is due to the independence between Y and U. Combining (3) and (5), for every ε > 0, we can choose σ 2 U large enough such that Since ε is arbitrary, the key capacity is lower bounded by The converse proof in [14] is directly applicable to continuous channel alphabets, provided that the average power constraint (1) can be incorporated into the arguments in [14, pp. 1129-1130]. This latter requirement is simplified by the additive and symmetric nature of the average power constraint [28, Section 3.6]. To avoid too much repetition, we outline below only the steps of the proof that are not directly available in [14, pp. 1129-1130].
For every permissible strategy with achievable key rate R, we have where the second line follows from Fano's inequality, the third line results from conditions (1) and (7) in the definition of achievable key rate, and the last line is due to condition (5).
Thus it suffices to upper bound I(K; L). From condition (3) in the definition of achievable key rate and the chain rule, we have where the second inequality is due to the fact that Now let Q be a uniform random variable that takes value from {1, 2, . . . , n} and is independent of all other random quantities. (9) can be rewritten as where the second inequality is due to the fact that Q → X → ( Y , Z) forms a Markov chain. On the other hand, the power constraint (1) implies that Combining (7), (8), and (10), we obtain Since ε can be arbitrarily small when n is sufficiently large, (12), together with (11), gives where the last line is due to the fact that p(y,

Key Capacity of Fast-Fading MIMO Wiretap Channel
Consider that the source, destination, and eavesdropper have m S , m D , and m W antennas, respectively. The antennas in each node are separated by at least a few wavelengths, and hence the fading processes of the channels across the transmit and receive antennas are independent. Using the complex baseband representation of the bandpass channel model: where (i) X is the m S × 1 complex-valued transmit symbol vector by the source, (ii) Y D is the m D × 1 complex-valued receive symbol vector at the destination, (iii) Y W is the m W × 1 complex-valued receive symbol vector at the eavesdropper, (iv) N D is the m D × 1 noise vector with independent identically distributed (i.i.d.) zero-mean, circularsymmetric complex Gaussian-distributed elements of variance σ 2 D (i.e., the real and imaginary parts of each elements are independent zero-mean Gaussian random variables with the same variance),  (14) is used n times as the We assume that the n uses of the wireless channel in (14) are i.i.d. so that the memoryless requirement of the (X, Y , Z) channel is satisfied. Since H D and H W are included in the respective channel symbols observable by the destination and eavesdropper (i.e., Y and Z, resp.), this model also implicitly assumes that the destination and eavesdropper have perfect CSI of their respective channels from the source. In practice, we can separate adjacent uses of the wireless channel by more than the coherence time of the channel to approximately ensure the i.i.d. channel use assumption. Training (known) symbols can be sent right before or after (within the channel coherence period) by the source so that the destination can acquire the required CSI. The eavesdropper may also use these training symbols to acquire the CSI of its own channel. If the CSI required at the destination is obtained in the way just described, then a unit of channel use includes the symbol X together with the associated training symbols. However, as in [29], we do not count the power required to send the training symbols (cf. (1)). Moreover we note that the source (and also the eavesdropper) may get some information about the outdated CSI of the destination channel, because information about the destination channel CSI, up to the previous use, may be fed back to the source from the destination via the public channel. More specifically, at time instant i j , the source symbol X j is a function of the feedback message Ψ ij −1 , which is in turn some function of the realizations of H D at time i 1 , i 2 , . . . , i j−1 . We also note that neither the source nor destination has any eavesdropper CSI. Referring back to (14), these two facts imply that X is independent of H D , H W , N D , 6 EURASIP Journal on Wireless Communications and Networking and N W ; that is, the current source symbol X is independent of the current channel state.
Since the fading MIMO wiretap channel model in (14) is a special case of the CW model considered in Section 2, the key capacity C K is given by Theorem 1 as Note that Substituting this back into (15), we get As a result, the key capacity of the fast-fading wiretap channel described by (14) can be obtained by maximizing the con- . This maximization problem is solved below.
Proof. To determine the key capacity, we need the following upper bound on the conditional entropy h(U | V ).

Lemma 1.
Let U and V be two jointly distributed complex random vectors of dimensions m U and m V , respectively. Let K U , K V , and K UV be the covariance of U, covariance of V , and cross-covariance of U and V , respectively. If K V is invertible, then The upper bound is achieved when [U T V T ] T is a circularsymmetric complex Gaussian random vector.
Proof. We can assume that both U and V have zero means without loss of generality. Also assume the existence of all unconditional and conditional covariances stated below. For each v, where K U|v is the covariance of U with respect to the conditional density p U|V (u | v) [29,Lemma 2]. This implies The second inequality above is due to the concavity of the function logdet over the set of positive definite symmetric matrices [30, 7.6.7], and the Jensen's inequality. To get the third inequality, observe that E V [K U|V ] can be interpreted as the covariance of the estimation error of estimating U by the conditional mean estimator E[U | V ]. On the other hand, K U − K UV K −1 V K VU is the covariance of the estimation error of using the linear minimum mean squared error estimator The inequality results from the fact that V V is a circular-symmetric complex Gaussian random vector [29,Lemma3] , so is U conditioned on V = v. Hence by [29,Lemma 2], the upper bound in (20) is achieved with K U|v = K U − K UV K −1 V K VU , which also gives the upper bound in (21).
To prove the theorem, we first obtain an upper bound on C K and then show that the upper bound is achievable. Using Lemma 1, we have where K YD and K YW are, respectively, the conditional covariances of Y D and Y W , given H D and H W , and K YDYW and K YW YD are the corresponding conditional cross-covariances. Substituting (22) into (17), an upper bound on C K is Thus we need to solve the maximization problem (23). To do so, let λ 1 , λ 2 , . . . , λ mS be the (nonnegative) eigenvalues of K X .
That is, we can assume K X = diag(λ 1 , λ 2 , . . . , λ mS ) with no loss of generality. Then we have the following lemma, which suggests that the objective function in (23) is a concave function depending only on the eigenvalues of the covariance of X.

Lemma 2.
Suppose that X has an arbitrary covariance K X , whose (nonnegative) eigenvalues are λ 1 , λ 2 , . . . , λ mS , then where the last equality is due to the matrix inversion formula. Substituting this result into the left-hand side of (25), we obtain the right-hand side of (24), and hence (25).
To show concavity of f , it suffices to consider only diagonal K X = diag(λ 1 , λ 2 , . . . , λ mS ) in Λ. Note that the mapping is linear in Λ. Also the mapping F : [32,Ex. 3.58]. Thus the composition theorem [32] gives that the mapping G : K X → K YD − K YDYW K −1 YW K YW YD is matrix-concave in Λ, since G = F • H. Another use of the composite theorem together with the concavity of the function logdet as mentioned in the proof of Lemma 1 shows that log det G is concave in Λ. Thus (25) implies that f is also concave in Λ.
Hence it suffices to consider only those X with zero mean in (23). Now define the constraint set Λ P = {λ i ≥ 0 for i = 1, 2, . . . , m S and mS i=1 λ i ≤ P}. Lemma 2 implies that we can find the upper bound on C K by calculating max ΛP f (λ 1 , λ 2 , . . . , λ mS ), whose value is given by the next lemma.

Lemma 3. One has
Proof. Since the elements of both H D and H W are i.i.d., f is invariant to any permutation of its arguments. This means that f is a symmetric function. By Lemma 2, f is also concave in Λ P . Thus it is Schur-concave [33]. Hence a Schur-minimal element (an element majorized by any another element) in Λ P maximizes f . It is easy to check that (P/m S , P/m S , . . . , P/m S ) is Schur-minimal in Λ P . Hence max ΛP f (λ 1 , λ 2 , . . . , λ mS ) = f (P/m S , P/m S , . . . , P/m S ).
Combining the results in (23), (24), Lemmas 2 and 3, we obtain the upper bound on the key capacity as where the identity det( where  to α 2 = 1. We observe that the key capacity levels off as P/σ 2 increases in three of the four channels, except the case of (m S , m D , m W ) = (2, 1, 1), considered in Figure 1. It appears that the relative antenna dimensions determine the asymptotic behavior of the key capacity when the SNR is large. To more precisely study this behavior, we evaluate the limiting value of C K as the input power P of the source becomes very large. To highlight the dependence of C K on P, we use the notation C K (P).
Proof. First fix (λ 1 , λ 2 , . . . , λ mS ) = (P/m S , P/m S , . . . , P/m S ) or equivalently K X = (P/m s )I mS , and consider the mapping G defined in the proof of Lemma 2 as a function of P. Also define Thus C K (P) = E[ f (P)]. It is not hard to check that for any P < P, G( P) ≥ G(P), which implies that det(G(P)) ≤ det(G( P)). Hence f is increasing in P.  (28), we have Since Hence Part (1) of the lemma results from monotone convergence.
For the case of m W < m S , the matrix inversion formula allows us to instead write Since where Now note that where H −1 W denotes the Penrose-Moore pseudoinverse of H W . Then (40) implies that Hence by Fatou's lemma, we get From (38), it is clear that f ∞ (P) increases without bound in P w.p.1; hence C ∞ (P) also increases without bound. Combining this fact with (43), we arrive at the conclusion of Part (2) of the lemma.
Part (1) of the lemma verifies the observations shown in Figure 1 that the key capacity levels off as the SNR increases if the number of source antennas is no larger than that of eavesdropper antennas. When the source has more antennas, Part (2) of the lemma suggests that the key capacity can grow without bound as P increases similarly to a MIMO fading channel with capacity C ∞ (P). Note that the matrix is a projection matrix to the orthogonal complement of the column space of H W . Thus C ∞ (P) has the physical interpretation that the secret information is passed across the dimensions not observable by the eavesdropper. The most interesting aspect is that this mode of operation can be achieved even if neither the source nor the destination knows the channel matrix H W . We note that the asymptotic behavior of the key capacity in the high SNR regime summarized in Corollary 1 is similar to the idea of secrecy degree of freedom introduced in [35]. The subtle difference here is that no up-to-date CSI of the destination channel is needed at the source.
Another interesting observation from Figure 1 is that for the case of (m S , m D , m W ) = (1, 10, 10), the source power P seems to have little effect on the key capacity. A small amount of source power is enough to get close to the leveling key capacity of about 1 bit per channel use. This observation is generalized below by Corollary 2, which characterizes the effect of spatial dimensionality of the destination and eavesdropper on the key capacity when the destination and eavesdropper both have a large number of antennas. Note that we can interpret the ratio β as the spatial dimensionality advantage of the eavesdropper over the destination. The expression for the limiting C K in the corollary clearly indicates that this spatial dimensionality advantage affects the key capacity in the same way as the channel gain advantage α 2 .
In Figure 2, the key capacities of several fast-fading MIMO channels with different numbers of source, destination, and eavesdropper antennas are plotted against the eavesdropper's channel gain advantage α 2 , with P/σ 2 = 10 dB. The results in Figure 2 show the other effect of spatial dimensionality. We observe that the key capacity decreases almost reciprocally with α 2 in the channels with (m S , m D , m W ) = (1, 1, 1) and (m S , m D , m W ) = (2, 2, 2), but stays almost constant for the channel with (m S , m D , m W ) = (2, 1, 1). It seems that the relative numbers of source and eavesdropper antennas again play the main role in differentiating these two different behaviors of the key capacity. To verify that, we evaluate the limiting value of C K as the gain advantage α 2 of the eavesdropper becomes very large. To highlight the dependence of C K on α 2 , we use the notation C K (α 2 ).

Corollary 3. One has
Proof. Similar to the proof of Corollary 1.
Similar to the case of large SNR, when the number of source antennas is larger than that of the eavesdropper's antennas, secret information can be passed across the dimensions not observable by the eavesdropper. This can be achieved with neither the source nor the destination knowing the channel matrix H W .

Alternative Achievability of Key Capacity
In this section, we provide an alternative proof of achievability for key capacity, which does not require the transmission of continuous symbols over the public channel. We derive the result from "first principles," which provides more insight on the desirable structure of a practical key agreement scheme. The main steps of the key agreement procedure are the following: (1) the source sends a sequence of i.i.d. symbols X n ; (2) the destination "quantizes" its received sequence Y n into Y n with a Wyner-Ziv compression scheme; (3) the destination uses a binning scheme with the quantized symbol sequences to determine the secret key and the information to feedback to the source over the public channel; (4) the source exploits the information sent by the destination to reconstruct the destination's quantized sequence Y n and uses the same binning scheme to generate its secret key.

Secret Sharing
Procedure. For convenience, we define the joint typicality indicator function T ε (·) that takes in a number of sequences as its arguments. The value of T ε (·) is 1 if the sequences are ε-jointly typical, and the value is 0 otherwise. Further define the indicator function for the sequence pair (y n , y n ): S ε y n , y n = ⎧ ⎨ ⎩ 1, if Pr T ε X n , y n , y n , Z n = 1 ≥ 1 − ε, where (X n , Z n ) is distributed according to p(x n , z n | y n , y n ) in the definition above. The source generates a random sequence X n distributed according to p(x n ). If X n satisfies the average power constraint (1), the source sends X n through the (X, Y , Z) channel. Otherwise, it ends the secret-sharing process. Since p(x) satisfies E[|X| 2 ] ≤ P, the law of large numbers implies that the probability of the latter event can be made arbitrarily small by increasing n. Hence we can assume below, with no loss of generality, that X n satisfies (1) and is sent by the source. This assumption helps to make the probability calculations in Section 4.3 less tedious.
Upon reception of the sequence Y n , the destination tries to quantize the received sequence. Let M be the output of its quantizer. Specifically, if there is a unique sequence Y n (m) ∈ C for some m ∈ {1, 2, . . . , 2 nR1 } such that S ε (Y n , Y n (m)) = 1, then it sets the output of the quantizer to M = m. If there is more than one such sequence, M is set to be the smallest sequence index m. If there is no such sequence, it sets M = 0. Let L and J be the unique indices such that Y n (M) ∈ C(J, L). The index L will be used as the key while the index J is fed back to the source over the public channel, that is, Ψ k = J. If M = 0, set J = 0 and choose L randomly over {1, 2, . . . , 2 nR3 } with uniform probabilities.
After receiving the feedback information J via the public channel, the source attempts to find a unique Y n (m) ∈ C such that T ε (X n , Y n (m)) = 1 and m ∈ C(J). If there is such a unique Y n (m), the source decodes M = m. If there is no such sequence or more than one such sequence, the source sets M = 0. If J = 0, it sets M = 0. Finally, if M > 0, the source generates its key K = k, such that M ∈ C(J, k). If M = 0, it sets K = 0.
We also consider a fictitious receiver who observes the sequence Z n and obtains both indices J and L via the public channel. This receiver sets M = 0 if J = 0. Otherwise, it attempts to find a unique Y n (m) ∈ C such that T ε ( Y n (m), Z n ) = 1 and m ∈ C(J, L). If there is such a unique Y n (m), the source decodes M = m. If there is no such sequence or more than one such sequence, the source sets M = 0.

Analysis of Probability of Error.
We use a random coding argument to establish the existence of a code with rates given by (46) such that Pr{K / = L} and Pr{M / = M} vanish in the limit of large block length n. Without further clarification, we note that the probabilities of the events below, except otherwise stated, are over the joint distribution of the codebook C, codewords, and all other random quantities involved.
Before we proceed, we introduce the following lemma regarding the indicator function S ε .
(3) If Y n distributes according to p(y n ), then Pr{S ε (Y n , Proof. (1) This claim is actually shown in [36]. We briefly sketch the proof here using our notation for completeness and easy reference. By the reverse Markov inequality [36], where the second inequality is due to that fact that Pr{T ε (X n , Y n , Y n , Z n ) = 1} > 1 − ε 2 for sufficiently large n.
(2) First, we only need to consider typical y n since the bound is trivial when y n is not typical. Notice that for any such y n , 1 ≥ T ε x n , y n , y n , z n p x n , y n , z n | y n dx n dz n d y n = Pr T ε X n , y n , y n , Z n = 1 · p y n , y n p y n d y n ≥ Pr T ε X n , y n , y n , Pr T ε X n , y n , y n , Z n = 1 d y n .

Now
Pr S ε y n , Y n = 1 = S ε y n , y n p y n d y n ≤ S ε y n , y n 2 −n(h( Y )−ε) d y n where the last inequality is due to (50).
(3) Same as Part (2), interchanging the roles of y n and y n . (4) From Part (1), we get 1 − ε < S ε y n , y n p y n , y n dy n d y n = S ε y n , y n p y n , y n p y n p y n p y n p y n dy n d y n · p y n p y n dy n d y n Moreover we need to bound the probabilities of the following events pertaining to M.
Proof. (1) We will use an argument similar to the one in the achievability proof of rate distortion function in [27,Section 10.5] to bound Pr{M = 0}. First note that {M = 0} is the event that S ε (Y n , Y n (m)) = 0 for all m ∈ {1, 2, . . . , R 1 }, and hence where the second equality is due to the fact that Y n (1), . . . , Y n (2 nR1 ) are i.i.d. given each fixed y n . But Pr S ε y n , Y n (1) = 0 2 nR 1 = 1 − S ε y n , y n p y n d y n 2 nR 1 = 1 − S ε y n , y n p y n | y n p y n p y n p y n , y n d y n ) S ε y n , y n p y n | y n d y n 2 nR 1 ≤ 1 − S ε y n , y n p y n | y n d y n + exp(−2 nε ), where the inequality on the fourth line is due to the fact that S ε (y n , y n ) = 1 implies T ε (y n , y n ) = 1, and the last line results from the inequality (1 − xy) k ≤ 1 − x + e −ky for all 0 ≤ x, y ≤ 1 and positive integer k [27, Lemma 10.5.3]. Substituting (54) back into (53) and using Lemma 4 Part (1), we get for sufficiently large n.
EURASIP Journal on Wireless Communications and Networking

13
(2) Notice that for m = 1, 2, . . . , 2 nR1 , where the second equality results from the i.i.d. nature of Y n (1), . . . , Y n (m). Thus we have where the last inequality is due to Part (2) of Lemma 4 since Y n and Y n (1) are independent.
(59) Thus applying Part (3) of the lemma, we get uniformly for all j = 1, 2, . . . , 2 nR2 and l = 1, 2, . . . , 2 nR3 , when n is sufficiently large. The third lower bound of (60) above is obtained from the inequality (1 − x) k ≥ 1 − kx for any 0 ≤ x ≤ 1 and positive integer k. The fourth lower bound is in turn based on the inequality (1 − x) k ≤ e −kx for 0 ≤ x ≤ 1 and positive integer k. We where E m is the event {T ε (X n , Y n (m)) = 0}, and E m is the event that there is an m ∈ C( j) such that m ∈ C( j), m / = m, and T ε (X n , Y n (m )) = 1. for sufficiently large n. This implies that there must exist a C n satisfying Pr{K / = L | C = C n } < 8ε, Pr{M / = M | C = C n } < 8ε, and Pr{M = 0 | C = C n } < 8ε. Thus, Parts (1) and (2) are proved. Now, fix this C n . For m = 1, 2, . . . , 2 nR1 , let y n (m) be the mth codeword of C n . Then, by Part (3) of Lemma 4, hence, Part (3) results. Note that, for l = 1, 2, . . . , 2 nR3 , We know from the discussion above that Pr{L = l | M = 0, C = C n }Pr{M = 0 | C = C n } < 2 −nR3 · 8ε. Also from Part Putting these back into (68), we get for sufficiently large n. Thus, Part (4) is proved.
In the remainder of the paper, we use a fixed code C n identified by Lemma 6. For convenience, we drop the conditioning on C n .

Conclusion
We evaluated the key capacity of the fast-fading MIMO wiretap channel. We found that spatial dimensionality provided by the use of multiple antennas at the source and destination can be employed to combat a channel-gain advantage of the eavesdropper over the destination. In particular if the source has more antennas than the eavesdropper, then the channel gain advantage of the eavesdropper can be completely overcome in the sense that the key capacity does not vanish when the eavesdropper channel gain advantage becomes asymptotically large. This is the most interesting observation of this paper, as no eavesdropper CSI is needed at the source or destination to achieve the non-vanishing key capacity.