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

Annals of Computer Science and Information Systems

Secret Key Sharing Protocol between Units Connected by Wireless MIMO Fading Channels

Guillermo B. Morales-Luna, Коржик Валерий Иванович, Aleksandr Gerasimovich, Cuong Nguyen, Vladimir Starostin, Viktor Yakovlev, М. М. Кабардов

Published Sep 26, 2018• 0 citations
Publisher

Abstract

The method of secret key sharing between units that did not possess any secret keys in advance is considered.It is assumed that between these units there are duplex wireless MIMO fading channels.In a recent paper published by D. Qin and Z. Dingh a new key sharing protocol has been proposed between legitimate users based on eigenvalues which are invariant under permutation of two matrices in their product.We extend this statement to a characteristic polynomial and by the way to matrix trace.Methods of key bits extraction are optimized both theoretically and experimentally.On the contrary to a statement of D. Qin and Z. Ding we prove that their key sharing protocol occurs insecure if eavesdroppers have the same channels as legitimate users.In order to provide reliability and security of the shared keys both error correction codes and privacy amplification methods can be used.

DOI
10.15439/2018f66

Related papers

Secret key agreement based on a communication through wireless MIMO-based fading channels

Guillermo B. Morales-Luna, Victor Yakovlev, Коржик Валерий Иванович +1 more

The method of key sharing between a mobile unit and a base station through a wireless MIMO-based fading channel is investigated.The description of a key distribution protocol is given.The expression to estimate the correct key bit agreement based on the use of guard interval is proved.Statistical properties of the key string are tested using the NIST criteria.Impossibility of key string eavesdropping by illegal users is guaranteed due to small values of correlation between legal and eavesdropper carrier phases.Numerical examples show that the MIMO system with 8 antennas is able to agree 256 bits with a reliability value 0.99 for SNR equal to 35 dB.This experiment confirms that the MIMO scenario is especially effective for secret key distribution.

Annals of Computer Science and Information Systems•Oct 2, 2016•2 citations

Information theoretical secure key sharing protocol for noiseless public constant parameter channels without cryptographic assumptions

Guillermo B. Morales-Luna, Коржик Валерий Иванович, Vladimir Starostin +4 more

We propose a new key sharing protocol executed through any constant parameter noiseless public channel (as Internet itself) without any cryptographic assumptions and protocol restrictions on SNR in the eavesdropper channels.This protocol is based on extraction by legitimate users of eigenvalues from randomly generated matrices.A similar protocol was proposed recently by G. Qin and Z. Ding.But we prove that, in fact, this protocol is insecure and we modify it to be both reliable and secure using artificial noise and privacy amplification procedure.Results of simulation prove these statements.

Annals of Computer Science and Information Systems•Sep 20, 2019•0 citations

Secret Key Generation With Precoding and Role Reversal in MIMO Wireless Systems

Saygın Bakşi, Dimitrie C. Popescu

Secret key generation based on channel measurements has emerged as a meaningful approach to enhance the security of wireless links. The key generation mechanism takes advantage of wireless channel reciprocity and uses the mutual information between legitimate users' channel measurements. However, the rate at which key bits are generated depends on the channel coherence time. Furthermore, eavesdroppers may obtain information to generate the secret key bits if their channels become correlated to the legitimate channels. In this paper, we propose a new approach for key generation that uses MIMO precoding and role switching by legitimate users during the key generation process in order to prevent an eavesdropper whose channel is correlated with the legitimate channel to acquire information that can be used to generate the encryption key, while also ensuring that the rate at which uncorrelated key bits are generated does not depend on the channel coherence time. The proposed approach is supported by an information theoretic analysis and is illustrated with numerical results obtained from simulations showing that, even when the legitimate and eavesdropper channels are correlated, the bit mismatch rate at the eavesdropper does not improve with increasing SNR, while that at the legitimate users improves.

IEEE Transactions on Wireless Communications•Apr 16, 2019•27 citations

Semi-Blind Key-Agreement over MIMO Fading Channels

Francesco Renna, Matthieu R. Bloch, Nicola Laurenti

We analyze the fundamental limits of secret-key agreement over MIMO quasi-static fading channels. In the low-power and high-power regimes, we establish closed-form expressions for secret-key capacity. In the low-power regime, we show that the optimal signaling strategy is independent of the eavesdropper's fading realization. The low-power secret-key capacity is achieved by transmitting along the direction corresponding to the maximal eigenvalue of the legitimate channel. By combining this signaling strategy with reconciliation and privacy amplification, one obtains a semi-blind key-distillation strategy in which the knowledge of the eavesdropper's fading is required for privacy amplification alone.

International Conference on Communications•Jun 1, 2011•1 citation

Semi-Blind Key-Agreement over MIMO Fading Channels

Francesco Renna, Matthieu R. Bloch, Nicola Laurenti

In this paper, we study the fundamental limits of secret-key agreement over MIMO quasi-static fading channels. We provide closed-form expressions for the secret-key capacity in both the asymptotic high-power and low-power regimes. The optimal signaling strategy for the low-power regime is shown to be independent of the eavesdropper's channel and secret-key capacity is achieved by transmitting random Gaussian symbols along the direction corresponding to the maximal eigenvalue of the legitimate channel matrix. Hence, by beamforming and waterfilling over the main channel alone, one obtains a semi-blind key-agreement strategy in which the knowledge of the eavesdropper's channel is only required for privacy amplification. We also derive the probability that a target secret-key rate is not achieved by the optimal low-power signaling when assuming only statistical CSI about the eavesdropper's channel.

IEEE Transactions on Communications•Oct 29, 2012•38 citations

Secret key generation via random beamforming in stationary environment

Longwang Cheng, Wei Li, Dongtang Ma

Extracting secret key from the common randomness of wireless channel has gained significant interest as a mechanism for providing secure point-to-point communications. Current works focus on the methods of exploiting channel characterizations based on Received Signal Strength Indication (RSSI), channel phase and Channel Impulse Response (CIR) under different propagation environments. However, when the channel fading is static or quasi-static, the secret key bits derived from the channel may be identical or nearly identical. In this paper, we propose a method to solve this problem in multiple-input multiple-output (MIMO) systems based on random beamforming. Compared with single antenna systems, MIMO systems offer more randomness available. Furthermore we consider the worst scenario where the eavesdropper Eve knows perfect knowledge of the legitimate channel. The quantization error probability at Eve is simulated to assess the security of the proposed method.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2015•15 citations
The method of secret key sharing between units that did not possess any secret keys in advance is considered.It is assumed that between these units there are duplex wireless MIMO fading channels.In a recent paper published by D. Qin and Z. Dingh a new key sharing protocol has been proposed between legitimate users based on eigenvalues which are invariant under permutation of two matrices in their product.We extend this statement to a characteristic polynomial and by the way to matrix trace.Methods of key bits extraction are optimized both theoretically and experimentally.On the contrary to a statement of D. Qin and Z. Ding we prove that their key sharing protocol occurs insecure if eavesdroppers have the same channels as legitimate users.In order to provide reliability and security of the shared keys both error correction codes and privacy amplification methods can be used.
The method of key sharing between a mobile unit and a base station through a wireless MIMO-based fading channel is investigated.The description of a key distribution protocol is given.The expression to estimate the correct key bit agreement based on the use of guard interval is proved.Statistical properties of the key string are tested using the NIST criteria.Impossibility of key string eavesdropping by illegal users is guaranteed due to small values of correlation between legal and eavesdropper carrier phases.Numerical examples show that the MIMO system with 8 antennas is able to agree 256 bits with a reliability value 0.99 for SNR equal to 35 dB.This experiment confirms that the MIMO scenario is especially effective for secret key distribution.
We propose a new key sharing protocol executed through any constant parameter noiseless public channel (as Internet itself) without any cryptographic assumptions and protocol restrictions on SNR in the eavesdropper channels.This protocol is based on extraction by legitimate users of eigenvalues from randomly generated matrices.A similar protocol was proposed recently by G. Qin and Z. Ding.But we prove that, in fact, this protocol is insecure and we modify it to be both reliable and secure using artificial noise and privacy amplification procedure.Results of simulation prove these statements.
Secret key generation based on channel measurements has emerged as a meaningful approach to enhance the security of wireless links. The key generation mechanism takes advantage of wireless channel reciprocity and uses the mutual information between legitimate users' channel measurements. However, the rate at which key bits are generated depends on the channel coherence time. Furthermore, eavesdroppers may obtain information to generate the secret key bits if their channels become correlated to the legitimate channels. In this paper, we propose a new approach for key generation that uses MIMO precoding and role switching by legitimate users during the key generation process in order to prevent an eavesdropper whose channel is correlated with the legitimate channel to acquire information that can be used to generate the encryption key, while also ensuring that the rate at which uncorrelated key bits are generated does not depend on the channel coherence time. The proposed approach is supported by an information theoretic analysis and is illustrated with numerical results obtained from simulations showing that, even when the legitimate and eavesdropper channels are correlated, the bit mismatch rate at the eavesdropper does not improve with increasing SNR, while that at the legitimate users improves.
We analyze the fundamental limits of secret-key agreement over MIMO quasi-static fading channels. In the low-power and high-power regimes, we establish closed-form expressions for secret-key capacity. In the low-power regime, we show that the optimal signaling strategy is independent of the eavesdropper's fading realization. The low-power secret-key capacity is achieved by transmitting along the direction corresponding to the maximal eigenvalue of the legitimate channel. By combining this signaling strategy with reconciliation and privacy amplification, one obtains a semi-blind key-distillation strategy in which the knowledge of the eavesdropper's fading is required for privacy amplification alone.
In this paper, we study the fundamental limits of secret-key agreement over MIMO quasi-static fading channels. We provide closed-form expressions for the secret-key capacity in both the asymptotic high-power and low-power regimes. The optimal signaling strategy for the low-power regime is shown to be independent of the eavesdropper's channel and secret-key capacity is achieved by transmitting random Gaussian symbols along the direction corresponding to the maximal eigenvalue of the legitimate channel matrix. Hence, by beamforming and waterfilling over the main channel alone, one obtains a semi-blind key-agreement strategy in which the knowledge of the eavesdropper's channel is only required for privacy amplification. We also derive the probability that a target secret-key rate is not achieved by the optimal low-power signaling when assuming only statistical CSI about the eavesdropper's channel.
Extracting secret key from the common randomness of wireless channel has gained significant interest as a mechanism for providing secure point-to-point communications. Current works focus on the methods of exploiting channel characterizations based on Received Signal Strength Indication (RSSI), channel phase and Channel Impulse Response (CIR) under different propagation environments. However, when the channel fading is static or quasi-static, the secret key bits derived from the channel may be identical or nearly identical. In this paper, we propose a method to solve this problem in multiple-input multiple-output (MIMO) systems based on random beamforming. Compared with single antenna systems, MIMO systems offer more randomness available. Furthermore we consider the worst scenario where the eavesdropper Eve knows perfect knowledge of the legitimate channel. The quantization error probability at Eve is simulated to assess the security of the proposed method.