Secret Key Agreement under Discussion Rate Constraints
Other conference paper


Full Text

Other information
AbstractFor 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.
Acceptance Date02/04/2017
All Author(s) ListC. Chan, M. Mukherjee, N. Kashyap, Q. Zhou
Name of ConferenceIEEE International Symposium on Information Theory (ISIT)
Start Date of Conference25/06/2017
End Date of Conference30/06/2017
Place of ConferenceAachen
Country/Region of ConferenceGermany
Year2017
LanguagesEnglish-United States

Last updated on 2018-18-01 at 08:23