ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

When is Omniscience a Rate-Optimal Strategy for Achieving Secret Key Capacity?

Chan, Chung and Mukherjee, Manuj and Kashyap, Navin and Zhou, Qiaoqiao (2016) When is Omniscience a Rate-Optimal Strategy for Achieving Secret Key Capacity? In: IEEE Information Theory Workshop (ITW), SEP 11-14, 2016, Cambridge, ENGLAND.

[img] PDF
IEEE_Inf_The_Wor_354_2016.pdf - Published Version
Restricted to Registered users only

Download (292kB) | Request a copy
Official URL: http://dx.doi.org/10.1109/ITW.2016.7606855


For the multiterminal secret key agreement problem under a private source model, it is known that the communication complexity required to achieve the capacity can be strictly smaller than the minimum rate of communication for omniscience, but a single-letter characterization is not known. We obtain a single-letter lower bound on the communication complexity as well as some conditions for the communication complexity to be maximal (equal to the smallest rate of communication tor omniscience). The results are are stated and derived using a meaningful multivariate mutual information measure. They are stronger than existing ones because 1) they apply to a general discrete memoryless multiple source rather than a special source model, 2) the problem formulation allows private randomization by individual users, 3) the bound is single-letter and the condition can be checked easily, and so 4) more scenarios in which the communication complexity is maximal are discovered. We conjecture that the lower bound can be further improved by giving a concrete example.

Item Type: Conference Proceedings
Additional Information: Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 07 Dec 2016 05:20
Last Modified: 07 Dec 2016 05:20
URI: http://eprints.iisc.ac.in/id/eprint/55493

Actions (login required)

View Item View Item