Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model

Mukherjee, Manuj and Chan, Chung and Kashyap, Navin and Zhou, Qiaoqiao (2016) Bounds on the Communication Rate Needed to Achieve SK Capacity in the Hypergraphical Source Model. In: IEEE International Symposium on Information Theory (ISIT), JUL 10-15, 2016, Barcelona, SPAIN, pp. 2504-2508.

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

Abstract

In the multiterminal source model of Csiszar and Narayan, the communication complexity, R-SK, for secret key (SK) generation is the minimum rate of communication required to achieve SK capacity. An obvious upper bound to R-SK is given by R-CO, which is the minimum rate of communication required for omniscience. In this paper we derive a better upper bound to R-SK for the hypergraphical source model, which is a special instance of the multiterminal source model. The upper bound is based on the idea of fractional removal of hyperedges. It is further shown that this upper bound can be computed in polynomial time. We conjecture that our upper bound is tight. For the special case of a graphical source model, we also give an explicit lower bound on R-SK. This bound, however, is not tight, as demonstrated by a counterexample.

Item Type:	Conference Proceedings
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:	09 Feb 2017 09:55
Last Modified:	09 Feb 2017 09:55
URI:	http://eprints.iisc.ac.in/id/eprint/56197

Actions (login required)

View Item