Secret key agreement for hypergraphical sources with limited total discussion

by   Chung Chan, et al.

We consider the multiterminal secret key agreement problem under the total discussion rate constraint and characterized the secrecy capacity for the hypergraphical sources. Our result not only covers the existing characterization for pairwise independent network but also extends it to the case with helpers, where the existing tree-packing protocol is known to be suboptimal. We show that decremental secret key agreement is optimal instead, which resolves a previous conjecture in the affirmative. The converse is established by a single-letter upper bound on secrecy capacity for general sources that are not necessarily hypergraphical. The minimax optimization involved in the upper bound can be relaxed to give various existing bounds such as the lamination bounds for hypergraphical sources, helper-set bound for general sources, the bound at asymptotically zero discussion rate via multivariate Gács–Körner common information, and the lower bound on communication complexity via a multivariate extension of Wyner common information. Our result not only unifies existing bounding techniques but also reveals surprising connections between seemingly different information-theoretic notions. We point out further challenges by showing that the bound can be loose for a simple finite linear source.



There are no comments yet.


page 1

page 2

page 3

page 4


Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate

In the multiterminal secret key agreement problem, a set of users want t...

Upper Bounds via Lamination on the Constrained Secrecy Capacity of Hypergraphical Sources

Hypergraphical sources are a natural class of sources for secret key gen...

Multiterminal Secret Key Agreement with Nearly No Discussion

We consider the secret key agreement problem under the multiterminal sou...

Wiretap Secret Key Agreement Via Secure Omniscience

In this paper, we explore the connection between secret key agreement an...

Unique Information and Secret Key Decompositions

The unique information (UI) is an information measure that quantifies a ...

On the Linear Capacity of Conditional Disclosure of Secrets

Conditional disclosure of secrets (CDS) is the problem of disclosing as ...

One-Shot Perfect Secret Key Agreement for Finite Linear Sources

We consider a non-asymptotic (one-shot) version of the multiterminal sec...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.