Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2403.02529 · IEEE Wireless Communications Letters

Secret-Key Capacity From MIMO Channel Probing

Yingbo Hua, Ahmed Maksud

Published Mar 5, 2024• 10 citations
arXivHTMLPDF

Abstract

Revealing expressions of secret-key capacity (SKC) based on data sets from Gaussian MIMO channel probing are presented. It is shown that Maurer’s upper and lower bounds on SKC coincide when the used data sets are produced from one-way channel probing. As channel coherence time increases, SKC in bits per probing channel use is always lower bounded by a positive value unless eavesdropper’s observations are noiseless, which is unlike SKC solely based on reciprocal channels.

DOI
10.1109/lwc.2024.3373716

Related papers

Second-Order Analysis of Secret-Key Capacity From a MIMO Channel

Ahmed Maksud, Yingbo Hua

This paper presents an analysis of Maurer-Ahlswede-Csiszar (MAC) bounds on secret-key capacity (SKC) based on a MIMO channel probing scheme between two multi-antenna nodes against a multi-antenna eavesdropper (Eve). To reveal useful insights into SKC, we consider the regime of high signal powers or high signal-to-noise ratios (SNR) where SKC consists of a first-order term (FoT) which is proportional to the logarithm of signal power, and a second-order term (SoT) which is invariant to signal power. Applying random-matrix theory for large numbers of antennas on all nodes, this paper shows the FoT and SoT of a lower MAC bound on SKC. While the FoT is consistent with prior work, which vanishes if none of the two nodes has more antennas than Eve and the channel is not perfectly reciprocal, the SoT shows a positive secrecy that increases linearly with the length of random transmissions from one node to another during channel probing even if Eve has many more antennas than the legitimate nodes.

IEEE Military Communications Conference (MILCOM)•Oct 30, 2023•1 citation

Secret Key Generation from MIMO Channel With or Without Reciprocity

Yingbo Hua, Ahmed Maksud

This paper presents a generalized channel probing (GCP) method and a generalized pre-processing (GPP) method as two consecutive frontend steps for secret key generation from a MIMO channel between two multi-antenna legitimate nodes against a multi-antenna eavesdropper (Eve). The degree of freedom (DoF) of the secret key capacity (SKC) of GCP/GPP are highlighted and discussed. If the number of antennas on Eve is larger than or equal to the larger number of the antennas on the two legitimate nodes, the SKC-DoF of GCP/GPP within each coherence period equals its minimum, which is either zero for non-reciprocal channel or the product of the numbers of antennas on the two legitimate nodes for reciprocal channel. Otherwise, the SKC-DoF of GCP/GPP increases with the number of random transmissions in GCP within each coherence period regardless of the channel reciprocity. A computational algorithm required for GPP is also discussed, and its performance illustrated via simulations.

Conference on Information Sciences and Systems•Mar 22, 2023•2 citations

Impact of Channel Estimation Errors on Secret Key Capacity in MIMO-OFDM Systems

K P Anjana, R. Ramanathan

MIMO-OFDM as well as MIMO systems are two steering technologies for 5G and beyond communication systems. The key problem with conventional method is that the security protocols used does not take any advantage of the wireless channel features, making eavesdropping a serious issue. This poses security issues at the physical layer. In this paper, we use SecretKey Capacity (SKC) on MIMO and MIMO-OFDM systems with more than one receiver antennas for the eavesdropper. We investigate the impact of channel estimation errors on the SKC performance. We derive the closed form expressions for SKC for both the MIMO and MIMO-OFDM channel The effect of channel estimation errors at the legitimate receiver end is also investigated for different MIMO-OFDM configurations. MIMO-OFDM channels can achieve positive SKC even when eavesdropper has higher number of receiver antenna than legitimate receiver, which is not possible in the case of MIMO channels. Increase in the channel estimation errors can increase SKC of the system. SKC results are discussed here with different number of transmit and receive antenna for eavesdropper and legitimate receiver.

International Conference on Communication Information and Computing Technology (ICCICT)•Jun 25, 2021•4 citations

Generalized Channel Probing and Generalized Pre-Processing for Secret Key Generation

Yingbo Hua

The paper considers secret key generation (SKG) from a channel between Alice and Bob against Eve all with multiple antennas. A generalized channel probing (GCP) method and a generalized pre-processing (GPP) method are proposed as two major steps before quantization, information reconciliation and privacy amplification for SKG. The degree-of-freedom (DoF) of the secret key capacity (SKC), relative to power or signal-to-noise ratio, based on the data sets at Alice, Bob and Eve after the execution of GCP is shown. The SKC-DoF is also shown to be the same as that based the new data sets after the application of GPP except for modifications chosen for computational efficiency. In particular, if Eve has a less number of antennas than either Alice and/or Bob, the SKC-DoF grows with the number of random transmissions from either Alice and/or Bob within each channel coherence period. This SKC-DoF property for GCP and GPP does not require the reciprocity of the channel. A reciprocal channel simply adds a product of the numbers of antennas at Alice and Bob towards the total SKC-DoF. Also shown in this paper is GCP with embedded public pilots, which results in no loss of SKC-DoF. Two prior methods for channel probing are also reviewed, and it is shown that none of them has the above mentioned SKC-DoF property despite previous claims. The potential application areas of GCP and GPP include both wireless and wireline networks.

IEEE Transactions on Signal Processing•Jan 1, 2023•28 citations

Investigation of Secret Key Capacity in MIMO-OFDM Wireless Systems

Chakka Sai Pradeep, R. Ramanathan

MIMO and MIMO-OFDM systems are the enabling technologies for the next generation wireless systems. However, the radio signals transmitted are available for reception by a illegitimate user leading to eavesdropping. This raises severe concerns on the security of the transmission. Physical Layer security aims to exploit the wireless channel characteristics and in turn provide secure transmission robust against eavesdropping. In this paper, we investigate the Secret Key Capacity (SKC) in MIMO-OFDM systems. We derive expressions for SKC in MIMO systems and extend further to OFDM waveforms. Numerical simulations are performed for various transmit and receive antenna configurations without any estimation errors.

Procedia Computer Science•Jan 1, 2018•5 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.1660•Nov 7, 2012•7 citations
Revealing expressions of secret-key capacity (SKC) based on data sets from Gaussian MIMO channel probing are presented. It is shown that Maurer’s upper and lower bounds on SKC coincide when the used data sets are produced from one-way channel probing. As channel coherence time increases, SKC in bits per probing channel use is always lower bounded by a positive value unless eavesdropper’s observations are noiseless, which is unlike SKC solely based on reciprocal channels.
This paper presents an analysis of Maurer-Ahlswede-Csiszar (MAC) bounds on secret-key capacity (SKC) based on a MIMO channel probing scheme between two multi-antenna nodes against a multi-antenna eavesdropper (Eve). To reveal useful insights into SKC, we consider the regime of high signal powers or high signal-to-noise ratios (SNR) where SKC consists of a first-order term (FoT) which is proportional to the logarithm of signal power, and a second-order term (SoT) which is invariant to signal power. Applying random-matrix theory for large numbers of antennas on all nodes, this paper shows the FoT and SoT of a lower MAC bound on SKC. While the FoT is consistent with prior work, which vanishes if none of the two nodes has more antennas than Eve and the channel is not perfectly reciprocal, the SoT shows a positive secrecy that increases linearly with the length of random transmissions from one node to another during channel probing even if Eve has many more antennas than the legitimate nodes.
This paper presents a generalized channel probing (GCP) method and a generalized pre-processing (GPP) method as two consecutive frontend steps for secret key generation from a MIMO channel between two multi-antenna legitimate nodes against a multi-antenna eavesdropper (Eve). The degree of freedom (DoF) of the secret key capacity (SKC) of GCP/GPP are highlighted and discussed. If the number of antennas on Eve is larger than or equal to the larger number of the antennas on the two legitimate nodes, the SKC-DoF of GCP/GPP within each coherence period equals its minimum, which is either zero for non-reciprocal channel or the product of the numbers of antennas on the two legitimate nodes for reciprocal channel. Otherwise, the SKC-DoF of GCP/GPP increases with the number of random transmissions in GCP within each coherence period regardless of the channel reciprocity. A computational algorithm required for GPP is also discussed, and its performance illustrated via simulations.
MIMO-OFDM as well as MIMO systems are two steering technologies for 5G and beyond communication systems. The key problem with conventional method is that the security protocols used does not take any advantage of the wireless channel features, making eavesdropping a serious issue. This poses security issues at the physical layer. In this paper, we use SecretKey Capacity (SKC) on MIMO and MIMO-OFDM systems with more than one receiver antennas for the eavesdropper. We investigate the impact of channel estimation errors on the SKC performance. We derive the closed form expressions for SKC for both the MIMO and MIMO-OFDM channel The effect of channel estimation errors at the legitimate receiver end is also investigated for different MIMO-OFDM configurations. MIMO-OFDM channels can achieve positive SKC even when eavesdropper has higher number of receiver antenna than legitimate receiver, which is not possible in the case of MIMO channels. Increase in the channel estimation errors can increase SKC of the system. SKC results are discussed here with different number of transmit and receive antenna for eavesdropper and legitimate receiver.
The paper considers secret key generation (SKG) from a channel between Alice and Bob against Eve all with multiple antennas. A generalized channel probing (GCP) method and a generalized pre-processing (GPP) method are proposed as two major steps before quantization, information reconciliation and privacy amplification for SKG. The degree-of-freedom (DoF) of the secret key capacity (SKC), relative to power or signal-to-noise ratio, based on the data sets at Alice, Bob and Eve after the execution of GCP is shown. The SKC-DoF is also shown to be the same as that based the new data sets after the application of GPP except for modifications chosen for computational efficiency. In particular, if Eve has a less number of antennas than either Alice and/or Bob, the SKC-DoF grows with the number of random transmissions from either Alice and/or Bob within each channel coherence period. This SKC-DoF property for GCP and GPP does not require the reciprocity of the channel. A reciprocal channel simply adds a product of the numbers of antennas at Alice and Bob towards the total SKC-DoF. Also shown in this paper is GCP with embedded public pilots, which results in no loss of SKC-DoF. Two prior methods for channel probing are also reviewed, and it is shown that none of them has the above mentioned SKC-DoF property despite previous claims. The potential application areas of GCP and GPP include both wireless and wireline networks.
MIMO and MIMO-OFDM systems are the enabling technologies for the next generation wireless systems. However, the radio signals transmitted are available for reception by a illegitimate user leading to eavesdropping. This raises severe concerns on the security of the transmission. Physical Layer security aims to exploit the wireless channel characteristics and in turn provide secure transmission robust against eavesdropping. In this paper, we investigate the Secret Key Capacity (SKC) in MIMO-OFDM systems. We derive expressions for SKC in MIMO systems and extend further to OFDM waveforms. Numerical simulations are performed for various transmit and receive antenna configurations without any estimation errors.
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.