Secret Key Generation for Minimally Connected Hypergraphical Sources
Information Theory
2019-07-30 v2 math.IT
Abstract
This paper investigates the secret key generation in the multiterminal source model, where users observing correlated sources discuss interactively under limited rates to agree on a secret key. We focus on a class of sources representable by minimally connected hypergraphs. For such sources, we give a single-letter explicit characterization of the region of achievable secret key rate and public discussion rate tuple. This is the first result that completely characterizes the achievable rate region for a multiterminal source model, which is beyond the PIN model on a tree. We also obtain an explicit formula for the maximum achievable secret key rate, called the constrained secrecy capacity, as a function of the total discussion rate.
Cite
@article{arxiv.1805.03110,
title = {Secret Key Generation for Minimally Connected Hypergraphical Sources},
author = {Qiaoqiao Zhou and Chung Chan},
journal= {arXiv preprint arXiv:1805.03110},
year = {2019}
}