2017/02/24 by Chung Chan, Manuj Mukherjee, Chan, Chung +5
Biochemistry, Genetics and Molecular Biology · Computer Science · Engineering · Mathematics · #DNA and Biological Computing #FOS: Computer and information sciences #Information Theory (cs.IT) #Security in Wireless Sensor Networks #Wireless Communication Security Techniques #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1702.07429
openalex publication_date 2017/02/24 · arxiv created 2018/01/05 · arxiv updated 2018/01/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.