Asymptotic converse bound for secret key capacity in hidden Markov model
Secret key establishment from common randomness has been traditionally investigated under cartain limiting assumptions, of which the most ubiquitous appears to be that the information available to all parties comes in the form of independent and identically distributed (i.i.d.) samples of some correlated random variables. Unfortunately, models employing the i.i.d assumption are often not accurate representations of real scenarios. A more capable model would represent the available information as correlated hidden Markov models (HMMs), based on the same underlying Markov chain. Such a model accurately reflects the scenario where all parties have access to imperfect observations of the same source random process, exhibiting a certain time dependency. In this paper, we derive a computationally-efficient asymptotic converse bound for the secret key capacity of the correlated-HMM scenario. The main obstacle, not only for our model, but also for other non-i.i.d cases, is the computational complexity. We address this by converting the initial bound to a product of Markov random matrices, and using recent results regarding its convergence to a Lyapunov exponent. The methods developed in the paper are easily extensible to derive a secret-key capacity lower bound.
Publication Source (Journal or Book title)
IEEE International Symposium on Information Theory - Proceedings
Shoja, M., Amariucai, G., Wang, Z., Wei, S., & Deng, J. (2017). Asymptotic converse bound for secret key capacity in hidden Markov model. IEEE International Symposium on Information Theory - Proceedings, 1968-1972. https://doi.org/10.1109/ISIT.2017.8006873