5 research outputs found

    On the Public Communication Needed to Achieve SK Capacity in the Multiterminal Source Model

    Full text link
    The focus of this paper is on the public communication required for generating a maximal-rate secret key (SK) within the multiterminal source model of Csisz{\'a}r and Narayan. Building on the prior work of Tyagi for the two-terminal scenario, we derive a lower bound on the communication complexity, RSKR_{\text{SK}}, defined to be the minimum rate of public communication needed to generate a maximal-rate SK. It is well known that the minimum rate of communication for omniscience, denoted by RCOR_{\text{CO}}, is an upper bound on RSKR_{\text{SK}}. For the class of pairwise independent network (PIN) models defined on uniform hypergraphs, we show that a certain "Type S\mathcal{S}" condition, which is verifiable in polynomial time, guarantees that our lower bound on RSKR_{\text{SK}} meets the RCOR_{\text{CO}} upper bound. Thus, PIN models satisfying our condition are RSKR_{\text{SK}}-maximal, meaning that the upper bound RSKRCOR_{\text{SK}} \le R_{\text{CO}} holds with equality. This allows us to explicitly evaluate RSKR_{\text{SK}} for such PIN models. We also give several examples of PIN models that satisfy our Type S\mathcal S condition. Finally, we prove that for an arbitrary multiterminal source model, a stricter version of our Type S\mathcal S condition implies that communication from \emph{all} terminals ("omnivocality") is needed for establishing a SK of maximum rate. For three-terminal source models, the converse is also true: omnivocality is needed for generating a maximal-rate SK only if the strict Type S\mathcal S condition is satisfied. Counterexamples exist that show that the converse is not true in general for source models with four or more terminals.Comment: Submitted to the IEEE Transactions on Information Theory. arXiv admin note: text overlap with arXiv:1504.0062

    On the Optimality of Secret Key Agreement via Omniscience

    Full text link
    For the multiterminal secret key agreement problem under a private source model, it is known that the maximum key rate, i.e., the secrecy capacity, can be achieved through communication for omniscience, but the omniscience strategy can be strictly suboptimal in terms of minimizing the public discussion rate. While a single-letter characterization is not known for the minimum discussion rate needed for achieving the secrecy capacity, we derive single-letter lower and upper bounds that yield some simple conditions for omniscience to be discussion-rate optimal. These conditions turn out to be enough to deduce the optimality of omniscience for a large class of sources including the hypergraphical sources. Through conjectures and examples, we explore other source models to which our methods do not easily extend

    The Communication Complexity of Achieving SK Capacity in a Class of PIN Models

    No full text
    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
    corecore