Secret Key Generation for Minimally Connected Hypergraphical Sources

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

3 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Article number8995629
Pages (from-to)4226-4244
Journal / PublicationIEEE Transactions on Information Theory
Volume66
Issue number7
Online published12 Feb 2020
Publication statusPublished - Jul 2020

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.

Research Area(s)

  • achievable rate region, contra-polymatroid, hypergraphical source, hypertree, minimally connected hypergraph, Multiterminal secret key generation