Secrecy Capacity under Limited Discussion Rate for Minimally Connected Hypergraphical Sources
share
We investigate the secret key generation in the multiterminal source model, where the users discuss under limited rate. For the minimally connected hypergraphical sources, we give an explicit formula of the maximum achievable secret key rate, called the secrecy capacity, under any given total discussion rate. Besides, we also partially characterize the region of achievable secret key rate and discussion rate tuple. When specializes to the hypertree sources, our results give rise to a complete characterization of the region.
READ FULL TEXT