Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate

Chung Chan; Manuj Mukherjee; Navin Kashyap; Qiaoqiao Zhou

doi:10.1109/ISIT.2018.8437913

Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate

Chung Chan, Manuj Mukherjee, Navin Kashyap, Qiaoqiao Zhou

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

8 Scopus citations

Abstract

In the multiterminal secret key agreement problem, a set of users want to discuss with each other until they share a common secret key independent of their discussion. We want to characterize the maximum secret key rate, called the secrecy capacity, asymptotically when the total discussion rate goes to zero. In the case of only two users, the capacity is equal to the Gács-Körner common information. However, when there are more than two users, the capacity is unknown. It is plausible that a multivariate extension of the Gács-Kömer common information is the capacity, however, proving the converse is challenging. We resolved this for the hypergraphical sources and finite linear sources, and provide efficiently computable characterizations. We also give some ideas of extending the techniques to more general source models.

Original language	English
Title of host publication	2018 IEEE International Symposium on Information Theory, ISIT 2018
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	2654-2658
Number of pages	5
ISBN (Print)	9781538647806
DOIs	https://doi.org/10.1109/ISIT.2018.8437913
State	Published - 15 Aug 2018
Externally published	Yes
Event	2018 IEEE International Symposium on Information Theory, ISIT 2018 - Vail, United States Duration: 17 Jun 2018 → 22 Jun 2018

Publication series

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

Conference

Conference	2018 IEEE International Symposium on Information Theory, ISIT 2018
Country/Territory	United States
City	Vail
Period	17/06/18 → 22/06/18

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

Funding

C. Chan (corresponding author, email: [email protected]) is with the Department of Computer Science, City University of Hong Kong. His work was supported in part by a grant from the University Grants Committee of the Hong Kong Special Administrative Region, China (Project No. 14200714) and in part by a grant from City University of Hong Kong (Project No. 7200564). His work was supported in part by a grant from the University Grants Committee of the Hong Kong Special Administrative Region, China (Project No. 14200714) and in part by a grant from City University of Hong Kong (Project No. 7200564). N. Kashyap ([email protected]) is with the Department of Electrical Communication Engineering, Indian Institute of Science, Bangalore 560012. His work was supported in part by a Swarnajayanti Fellowship awarded by the Department of Science & Technology, Government of India.

Funders	Funder number
University Grants Committee of the Hong Kong Special Administrative Region, China	14200714
City University of Hong Kong	7200564
University Grants Committee
Department of Science and Technology, Government of West Bengal

Access to Document

10.1109/ISIT.2018.8437913

Cite this

Chan, C., Mukherjee, M., Kashyap, N., & Zhou, Q. (2018). Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. In 2018 IEEE International Symposium on Information Theory, ISIT 2018 (pp. 2654-2658). Article 8437913 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2018.8437913

@inproceedings{5f74e05f2ae14cd4aabe1e0f91b3795f,

title = "Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate",

abstract = "In the multiterminal secret key agreement problem, a set of users want to discuss with each other until they share a common secret key independent of their discussion. We want to characterize the maximum secret key rate, called the secrecy capacity, asymptotically when the total discussion rate goes to zero. In the case of only two users, the capacity is equal to the G{\'a}cs-K{\"o}rner common information. However, when there are more than two users, the capacity is unknown. It is plausible that a multivariate extension of the G{\'a}cs-K{\"o}mer common information is the capacity, however, proving the converse is challenging. We resolved this for the hypergraphical sources and finite linear sources, and provide efficiently computable characterizations. We also give some ideas of extending the techniques to more general source models.",

author = "Chung Chan and Manuj Mukherjee and Navin Kashyap and Qiaoqiao Zhou",

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

year = "2018",

month = aug,

day = "15",

doi = "10.1109/ISIT.2018.8437913",

language = "אנגלית",

isbn = "9781538647806",

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

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

pages = "2654--2658",

booktitle = "2018 IEEE International Symposium on Information Theory, ISIT 2018",

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

}

Chan, C, Mukherjee, M, Kashyap, N & Zhou, Q 2018, Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. in 2018 IEEE International Symposium on Information Theory, ISIT 2018., 8437913, IEEE International Symposium on Information Theory - Proceedings, vol. 2018-June, Institute of Electrical and Electronics Engineers Inc., pp. 2654-2658, 2018 IEEE International Symposium on Information Theory, ISIT 2018, Vail, United States, 17/06/18. https://doi.org/10.1109/ISIT.2018.8437913

Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate. / Chan, Chung; Mukherjee, Manuj; Kashyap, Navin et al.
2018 IEEE International Symposium on Information Theory, ISIT 2018. Institute of Electrical and Electronics Engineers Inc., 2018. p. 2654-2658 8437913 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-June).

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

TY - GEN

T1 - Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate

AU - Chan, Chung

AU - Mukherjee, Manuj

AU - Kashyap, Navin

AU - Zhou, Qiaoqiao

PY - 2018/8/15

Y1 - 2018/8/15

N2 - In the multiterminal secret key agreement problem, a set of users want to discuss with each other until they share a common secret key independent of their discussion. We want to characterize the maximum secret key rate, called the secrecy capacity, asymptotically when the total discussion rate goes to zero. In the case of only two users, the capacity is equal to the Gács-Körner common information. However, when there are more than two users, the capacity is unknown. It is plausible that a multivariate extension of the Gács-Kömer common information is the capacity, however, proving the converse is challenging. We resolved this for the hypergraphical sources and finite linear sources, and provide efficiently computable characterizations. We also give some ideas of extending the techniques to more general source models.

AB - In the multiterminal secret key agreement problem, a set of users want to discuss with each other until they share a common secret key independent of their discussion. We want to characterize the maximum secret key rate, called the secrecy capacity, asymptotically when the total discussion rate goes to zero. In the case of only two users, the capacity is equal to the Gács-Körner common information. However, when there are more than two users, the capacity is unknown. It is plausible that a multivariate extension of the Gács-Kömer common information is the capacity, however, proving the converse is challenging. We resolved this for the hypergraphical sources and finite linear sources, and provide efficiently computable characterizations. We also give some ideas of extending the techniques to more general source models.

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

U2 - 10.1109/ISIT.2018.8437913

DO - 10.1109/ISIT.2018.8437913

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

AN - SCOPUS:85052484360

SN - 9781538647806

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2654

EP - 2658

BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018

Y2 - 17 June 2018 through 22 June 2018

ER -

Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate

Abstract

Publication series

Conference

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Cite this