On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals
arXiv:0805.3200
Abstract
Csiszar and Narayan[3] defined the notion of secret key capacity for multiple terminals, characterized it as a linear program with Slepian-Wolf constraints of the related source coding problem of communication for omniscience, and upper bounded it by some information divergence expression from the joint to the product distribution of the private observations. This paper proves that the bound is tight for the important case when all users are active, using the polymatroidal structure[6] underlying the source coding problem. When some users are not active, the bound may not be tight. This paper gives a counter-example in which 3 out of the 6 terminals are active.
5 pages. This is a concise version. See the first version for detailed explanations and an illustration of the proof
Cited by in corpus (6)
- Secret key agreement for hypergraphical sources with limited total discussion
- Shared Information for a Markov Chain on a Tree
- Multiterminal Secret Key Agreement with Nearly No Discussion
- Attaining Fairness in Communication for Omniscience
- Part II: A Practical Approach for Successive Omniscience
- Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience