Secret-Key Capacity from MIMO Channel Probing
Information Theory
2025-07-21 v1 Signal Processing
math.IT
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.
Cite
@article{arxiv.2403.02529,
title = {Secret-Key Capacity from MIMO Channel Probing},
author = {Yingbo Hua and Ahmed Maksud},
journal= {arXiv preprint arXiv:2403.02529},
year = {2025}
}
Comments
Accepted for publication in IEEE Wireless Communications Letters