The communication complexity of achieving SK capacity in a class of PIN models

Manuj Mukherjee; Navin Kashyap

doi:10.1109/ISIT.2015.7282464

The communication complexity of achieving SK capacity in a class of PIN models

Manuj Mukherjee, Navin Kashyap

Indian Institute of Science Bangalore

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

Abstract

The communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csiszár 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.

Original language	English
Title of host publication	Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	296-300
Number of pages	5
ISBN (Electronic)	9781467377041
DOIs	https://doi.org/10.1109/ISIT.2015.7282464
State	Published - 28 Sep 2015
Externally published	Yes
Event	IEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong Duration: 14 Jun 2015 → 19 Jun 2015

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2015-June
ISSN (Print)	2157-8095

Conference

Conference	IEEE International Symposium on Information Theory, ISIT 2015
Country/Territory	Hong Kong
City	Hong Kong
Period	14/06/15 → 19/06/15

Bibliographical note

Publisher Copyright:
© 2015 IEEE.

Access to Document

10.1109/ISIT.2015.7282464

Cite this

Mukherjee, M., & Kashyap, N. (2015). The communication complexity of achieving SK capacity in a class of PIN models. In Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015 (pp. 296-300). Article 7282464 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282464

@inproceedings{fbb41b183e494aa59bf4123b200b7b25,

title = "The communication complexity of achieving SK capacity in a class of PIN models",

abstract = "The communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csisz{\'a}r 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 RCO, is an upper bound on the communication complexity, denoted by RSK. A source model for which this upper bound is tight is called RSK-maximal. In this paper, we establish a sufficient condition for RSK-maximality within the class of pairwise independent network (PIN) models defined on hypergraphs. This allows us to compute RSK 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 RSK-maximality for sources beyond PIN models.",

author = "Manuj Mukherjee and Navin Kashyap",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.; IEEE International Symposium on Information Theory, ISIT 2015 ; Conference date: 14-06-2015 Through 19-06-2015",

year = "2015",

month = sep,

day = "28",

doi = "10.1109/ISIT.2015.7282464",

language = "אנגלית",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "296--300",

booktitle = "Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015",

address = "ארצות הברית",

}

Mukherjee, M & Kashyap, N 2015, The communication complexity of achieving SK capacity in a class of PIN models. in Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015., 7282464, IEEE International Symposium on Information Theory - Proceedings, vol. 2015-June, Institute of Electrical and Electronics Engineers Inc., pp. 296-300, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 14/06/15. https://doi.org/10.1109/ISIT.2015.7282464

The communication complexity of achieving SK capacity in a class of PIN models. / Mukherjee, Manuj; Kashyap, Navin.
Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 296-300 7282464 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2015-June).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The communication complexity of achieving SK capacity in a class of PIN models

AU - Mukherjee, Manuj

AU - Kashyap, Navin

PY - 2015/9/28

Y1 - 2015/9/28

N2 - The communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csiszár 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 RCO, is an upper bound on the communication complexity, denoted by RSK. A source model for which this upper bound is tight is called RSK-maximal. In this paper, we establish a sufficient condition for RSK-maximality within the class of pairwise independent network (PIN) models defined on hypergraphs. This allows us to compute RSK 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 RSK-maximality for sources beyond PIN models.

AB - The communication complexity of achieving secret key (SK) capacity in the multiterminal source model of Csiszár 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 RCO, is an upper bound on the communication complexity, denoted by RSK. A source model for which this upper bound is tight is called RSK-maximal. In this paper, we establish a sufficient condition for RSK-maximality within the class of pairwise independent network (PIN) models defined on hypergraphs. This allows us to compute RSK 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 RSK-maximality for sources beyond PIN models.

UR - http://www.scopus.com/inward/record.url?scp=84969795547&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2015.7282464

DO - 10.1109/ISIT.2015.7282464

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84969795547

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 296

EP - 300

BT - Proceedings - 2015 IEEE International Symposium on Information Theory, ISIT 2015

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - IEEE International Symposium on Information Theory, ISIT 2015

Y2 - 14 June 2015 through 19 June 2015

ER -

The communication complexity of achieving SK capacity in a class of PIN models

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this