2017/01/18 by Chung Chan, Manuj Mukherjee, Chan, Chung +5
Computer Science · Engineering · #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #Security in Wireless Sensor Networks #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1701.05008
openalex publication_date 2017/01/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the public discussion rate required to achieve any given secret key rate below the secrecy capacity. The results apply to general source model without helpers or wiretapper's side information but can be strengthened for hypergraphical sources. In particular, for the pairwise independent network, the results give rise to a complete characterization of the maximum secret key rate achievable under a constraint on the total discussion rate.