Secret Key Agreement under Discussion Rate Constraints
Information Theory
2017-01-20 v2 math.IT
Abstract
For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below the secrecy capacity. The results apply to general source model without helpers or wiretapper's side information but can be strengthened for hypergraphical sources. In particular, for the pairwise independent network, the results give rise to a complete characterization of the maximum secret key rate achievable under a constraint on the total discussion rate.
Cite
@article{arxiv.1701.05008,
title = {Secret Key Agreement under Discussion Rate Constraints},
author = {Chung Chan and Manuj Mukherjee and Navin Kashyap and Qiaoqiao Zhou},
journal= {arXiv preprint arXiv:1701.05008},
year = {2017}
}