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

The Communication Complexity of Achieving SK Capacity in a Class of PIN Models

Mukherjee, Manuj and Kashyap, Navin (2015) The Communication Complexity of Achieving SK Capacity in a Class of PIN Models. In: IEEE International Symposium on Information Theory (ISIT), JUN 14-19, 2015, Hong Kong, PEOPLES R CHINA, pp. 296-300.

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

Download (181kB) | Request a copy
Official URL: https://arxiv.org/pdf/1504.00629v2.pdf


The communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csiszar and Narayan is the minimum rate of public communication required to generate a maximal-rate SK. It is well known that the minimum rate of communication for omniscience, denoted by R-CO, is an upper bound on the communication complexity, denoted by R-SK. A source model for which this upper bound is tight is called R-SK-maximal. In this paper, we establish a sufficient condition for R-SK-maximality within the class of pairwise independent network (PIN) models defined on hypergraphs. This allows us to compute R-SK exactly within the class of PIN models satisfying this condition. On the other hand, we also provide a counterexample that shows that our condition does not in general guarantee R-SK-maximality for sources beyond PIN models.

Item Type: Conference Paper
Series.: IEEE International Symposium on Information Theory
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: 30 Dec 2016 05:52
Last Modified: 30 Dec 2016 05:52
URI: http://eprints.iisc.ac.in/id/eprint/55505

Actions (login required)

View Item View Item