IEEE Transactions on Information Forensics and Security

Noncoherent Capacity of Secret-Key Agreement With Public Discussion

Anurag Agrawal, Zouheir Rezki, Ashish J. Khisti, Mohamed‐Slim Alouini

Published Jun 17, 2011• 23 citations

Abstract

We study the noncoherent capacity of secret-key agreement with public discussion over independent identically distributed (i.i.d.) Rayleigh fading wireless channels, where neither the sender nor the receivers have access to instantaneous channel state information (CSI). We present two results. At high signal-to-noise ratio (SNR), the secret-key capacity is bounded in SNR, regardless of the number of antennas at each terminal. Second, for a system with a single antenna at both the legitimate and the eavesdropper terminals and an arbitrary number of transmit antennas, the secret-key capacity-achieving input distribution is discrete, with a finite number of mass points. Numerically we observe that at low SNR, the capacity achieving distribution has two mass points with one of them at the origin.

DOI: 10.1109/tifs.2011.2158999

Related papers

Non-Coherent Capacity of Secret-Key Agreement with Public Discussion

Anurag Agrawal, Zouheir Rezki, Ashish J. Khisti +1 more

We study the Rayleigh fading non-coherent capacity of secret-key agreement with public discussion, where neither the sender nor the receivers have access to instantaneous channel state information (CSI) of any channel. We present two results. At high Signal-to-Noise Ratio (SNR), the secret-key capacity is bounded in SNR, regardless of the number of antennas at each terminal. Second, for a system with a single antenna at both the legitimate and the eavesdropper terminals and an arbitrary number of transmit antennas, the secret-key capacity-achieving input distribution is discrete, with a finite number of mass points. Numerically we observe that at low-SNR, the capacity achieving distribution has two mass points with one of them at the origin.

IEEE International Conference on Communications workshopsJun 1, 20112 citations

Secret-key agreement over spatially correlated fast-fading multiple-antenna channels with public discussion

Marwen Zorgui, Zouheir Rezki, Basel Alomair +1 more

We consider secret-key agreement with public discussion over multiple-input multiple-output (MIMO) Rayleigh fast-fading channels under correlated environment. We assume that transmit, legitimate receiver and eavesdropper antennas are correlated. The legitimate receiver and the eavesdropper are assumed to have perfect channel knowledge while the transmitter has only knowledge of the correlation matrices. First, we derive the expression of the secret-key capacity under the considered setup. Then, we prove that the optimal transmit strategy achieving the secret-key capacity consists in transmitting independent Gaussian signals along the eingenvectors of the transmit correlation matrix. The powers allocated to each channel mode are determined as the solution to a numerical optimization problem that we derive. A necessary and sufficient condition for beamforming (i.e., transmitting along the strongest channel mode) to be capacity-achieving is derived. Finally, we analyze the impact of correlation matrices on the system performance and provide closed-form expressions of the gain/loss due to correlation in the high power regime.

IEEE International Symposium on Information Theory (ISIT)Jun 1, 20152 citations

Secret-key agreement over spatially correlated multiple-antenna channels in the low-SNR regime

Marwen Zorgui, Zouheir Rezki, Basel Alomair +2 more

We consider secret-key agreement with public discussion over Rayleigh fast-fading channels with transmit, receive and eavesdropper correlation. The legitimate receiver along with the eavesdropper are assumed to have perfect channel knowledge while the transmitter has only knowledge of the correlation matrices. We analyze the secret-key capacity in the low signal-to-noise ratio (SNR) regime. We derive closed-form expressions for the first and the second derivatives of the secret-key capacity with respect to SNR at SNR= 0, for arbitrary correlation matrices and number of transmit, receive and eavesdropper antennas. Moreover, we identify optimal transmission strategies achieving these derivatives. For instance, we prove that achieving the first and the second derivatives requires a uniform power distribution between the eigenvectors spanning the maximal-eigenvalue eigenspace of the transmit correlation matrix. We also compare the optimal transmission scheme to a simple uniform power allocation. Finally, we express the minimum energy required for sharing a secret-key bit as well as the wideband slope in terms of the system parameters.

IEEE Conference on Communications and Network SecuritySep 1, 20151 citation

On the Ergodic Secret-Key Agreement Over Spatially Correlated Multiple-Antenna Channels With Public Discussion

Marwen Zorgui, Zouheir Rezki, Basel Alomair +2 more

We consider secret-key agreement with public discussion over multiple-input multiple-output (MIMO) Rayleigh fast-fading channels under correlated environment. We assume that transmit, legitimate receiver, and eavesdropper antennas are correlated. The legitimate receiver and the eavesdropper are assumed to have perfect channel knowledge while the transmitter has only knowledge of the correlation matrices. First, we derive the expression of the secret-key capacity under the considered setup. We prove that the optimal transmit strategy achieving the secret-key capacity consists in transmitting independent Gaussian signals along the eingenvectors of the transmit correlation matrix. The powers allocated to each channel mode are determined as the solution to a numerical optimization problem. A necessary and sufficient condition for beamforming (i.e., transmitting along the strongest channel mode) to be capacity-achieving is derived. Moreover, we analyze the impact of correlation matrices on the system performance. Finally, we study the system's performance in the two extreme power regimes. In the high-power regime, we provide closed-form expressions of the gain/loss due to correlation. In the low signal-to-noise ratio (SNR) regime, we investigate the energy efficiency of the system by determining the minimum energy required for sharing a secret-key bit and the wideband slope while highlighting the impact of correlation matrices.

IEEE Transactions on Signal ProcessingSep 28, 201511 citations

Secret-Key Agreement Over Non-Coherent Block-Fading Channels With Public Discussion

Ashish J. Khisti

Motivated by recent interest in physical-layer secret-key generation over wireless fading channels, we study the non-coherent secret-key generation capacity of a block-fading wireless channel with channel reciprocity and bi-directional (two-way) communication. We assume a non-coherent main channel, i.e., the realization of channel gains on the main channel is not known to any terminal. The eavesdropper is assumed to have both perfect Channel State Information of its own channel and orthogonal observations from the forward and backward channels. As our main result, we establish new upper and lower bounds on the secret-key generation capacity with public discussion, which are structurally similar. The upper bound can be expressed as a sum of three terms-one of the terms arises due to channel reciprocity, while the other two terms correspond to communication on the forward and backward channels, respectively. In the limit of long coherence period, the contribution from channel reciprocity vanishes to zero, whereas the other terms prevail. The lower bound is based on a separation based scheme. In each coherence block, we use the first symbol for training while the remainder of the coherence block is devoted to source emulation, i.e., to generate correlated sources between the terminals. The lower bound expression also consists of three terms and admits an interpretation similar to the upper bound expression. For Rayleigh fading channels, in the high signal-to-noise ratio (SNR) regime, the gap between the upper and lower bounds is shown to vanish inversely with the coherence period. Numerical results indicate significant performance gains over training-only schemes even for moderate values of SNR and small coherence periods.

IEEE Transactions on Information TheoryOct 19, 201624 citations

Secret-Key Agreement Capacity over Reciprocal Fading Channels: A Separation Approach

Ashish J. Khisti

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are correlated. The channel gains between the legitimate terminals are not revealed to any terminal, whereas the channel gains of the eavesdropper are revealed to the eavesdropper. We propose a two-phase transmission scheme, that reserves a certain portion of each coherence block for channel estimation, and the remainder of the coherence block for correlated source generation. The resulting secret-key involves contributions of both channel sequences and source sequences, with the contribution of the latter becoming dominant as the coherence period increases. We also establish an upper bound on the secret-key capacity, which has a form structurally similar to the lower bound. Our upper and lower bounds coincide in the limit of high signal-to-noise-ratio (SNR) and large coherence period, thus establishing the secret-key agreement capacity in this asymptotic regime. Numerical results indicate that the proposed scheme achieves significant gains over training-only schemes, even for moderate SNR and small coherence periods, thus implying the necessity of randomness-sharing in practical secret-key generation systems.

arXiv:1211.1660Nov 7, 20127 citations