Abstract

The communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csiszar and Narayan is the minimum rate of public communication required to generate a maximal-rate SK. It is well known that the minimum rate of communication for omniscience, denoted by R CO , is an upper bound on the communication complexity, denoted by R SK . A source model for which this upper bound is tight is called R SK -maximal. In this paper, we establish a sufficient condition for R SK -maximality within the class of pairwise independent network (PIN) models defined on hypergraphs. This allows us to compute R SK exactly within the class of PIN models satisfying this condition. On the other hand, we also provide a counterexample that shows that our condition does not in general guarantee R SK -maximality for sources beyond PIN models.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.