On the Secret Key Capacity of Sibling Hidden Markov Models
- 12 July 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 14 (2) , 514-524
Abstract
Traditional approaches to secret key establishment based on common randomness have been based on certain restrictive assumptions, such as considering the available common randomness to consist of independent and identically distributed (i.i.d) repetitions of correlated random variables. Unfortunately, the i.i.d assumption does not generally reflect the conditions of real-life scenarios. For this reason, the current paper investigates the key-establishment potential of a more pragmatic model, in which all parties have access to imperfect information about a common source modeled as a Markov chain. Each party's information thus comes in the form of a hidden Markov model and, since the different parties share the same underlying Markov chain, we call the overall model a sibling hidden Markov model (SHMM). This paper studies upper and lower bounds on the secret key capacity for various types of SHMM. The difficulty of the problem emerges from its prohibitive computational cost. To address this obstacle, we represent the joint probability of the observations as the L 1 norm of a Markov random matrix, and use its convergence to a Lyapunov exponent.Keywords
Funding Information
- National Science Foundation (CCF-1320351, CNS-1527579)
- NSA (H98230-15-1-0281)
This publication has 25 references indexed in Scilit:
- Secret Key Agreement: General Capacity and Second-Order AsymptoticsIEEE Transactions on Information Theory, 2016
- Secret Common Randomness From Routing Metadata in Ad Hoc NetworksIEEE Transactions on Information Forensics and Security, 2016
- Uniform Random Number Generation From Markov Chains: Non-Asymptotic and Asymptotic AnalysesIEEE Transactions on Information Theory, 2016
- Quickest Change Detection and Kullback-Leibler Divergence for Two-State Hidden Markov ModelsIEEE Transactions on Signal Processing, 2015
- A Separable Model for Dynamic NetworksJournal of the Royal Statistical Society Series B: Statistical Methodology, 2013
- Estimating generalized Lyapunov exponents for products of random matricesPhysical Review E, 2010
- Smooth Entropies and the Quantum Information SpectrumIEEE Transactions on Information Theory, 2009
- On the entropy of a hidden Markov processTheoretical Computer Science, 2008
- An upper bound for the largest Lyapunov exponent of a Markovian product of nonnegative matricesTheoretical Computer Science, 2005
- Experimental characterization of the MIMO wireless channel: data acquisition and analysisIEEE Transactions on Wireless Communications, 2003