Abstract
For the multiterminal secret key agreement problem, new single-letter lower bounds are obtained on the minimum public discussion rate required to achieve any given secret key rate below the secrecy capacity. The results apply to the general source model without helpers or wiretapper's side information, but can be strengthened for hypergraphical sources. In particular, for the pairwise independent network, our results yield a complete characterization of the maximum secret key rate achievable under a constraint on the total discussion rate.
Original language | English |
---|---|
Title of host publication | 2017 IEEE International Symposium on Information Theory, ISIT 2017 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 1519-1523 |
Number of pages | 5 |
ISBN (Electronic) | 9781509040964 |
DOIs | |
State | Published - 9 Aug 2017 |
Externally published | Yes |
Event | 2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany Duration: 25 Jun 2017 → 30 Jun 2017 |
Publication series
Name | IEEE International Symposium on Information Theory - Proceedings |
---|---|
Volume | 0 |
ISSN (Print) | 2157-8095 |
Conference
Conference | 2017 IEEE International Symposium on Information Theory, ISIT 2017 |
---|---|
Country/Territory | Germany |
City | Aachen |
Period | 25/06/17 → 30/06/17 |
Bibliographical note
Publisher Copyright:© 2017 IEEE.