On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Mukherjee, Manuj and Kashyap, Navin (2014) On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model. In: IEEE International Symposium on Information Theory (ISIT), JUN 29-JUL 04, 2014, Honolulu, HI, pp. 1151-1155.

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

Abstract

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.

Item Type:	Conference Proceedings
Series.:	IEEE International Symposium on Information Theory
Publisher:	IEEE
Additional Information:	Copy right for this article belongs to the IEEE International Symposium on Information Theory (ISIT), Honolulu, HI, JUN 29-JUL 04, 2014
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	04 Mar 2015 13:00
Last Modified:	04 Mar 2015 13:00
URI:	http://eprints.iisc.ac.in/id/eprint/51007

Actions (login required)

View Item