Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate

Chan, Chung and Mukherjee, Manuj and Kashyap, Navin and Zhou, Qiaoqiao (2018) Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. In: IEEE International Symposium on Information Theory (ISIT), JUN 17-22, 2018, Vail, CO, pp. 2654-2658.

PDF ISIT_2654_2018.pdf - Published Version Restricted to Registered users only Download (674kB) | Request a copy

Abstract

In the multiterminal secret key agreement problem, a set of users want to discuss with each other until they share a common secret key independent of their discussion. We want to characterize the maximum secret key rate, called the secrecy capacity, asymptotically when the total discussion rate goes to zero. In the case of only two users, the capacity is equal to the Gacs-Korner common information. However, when there are more than two users, the capacity is unknown. It is plausible that a multivariate extension of the Gacs-Korner common information is the capacity, however, proving the converse is challenging. We resolved this for the hypergraphical sources and finite linear sources, and provide efficiently computable characterizations. We also give some ideas of extending the techniques to more general source models.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belong to IEEE
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	24 Nov 2018 14:29
Last Modified:	24 Nov 2018 14:29
URI:	http://eprints.iisc.ac.in/id/eprint/61143

Actions (login required)

View Item