One-Shot Perfect Secret Key Agreement for Finite Linear Sources

Chung Chan; Navin Kashyap; Praneeth Kumar Vippathalla; Qiaoqiao Zhou

doi:10.1109/ISIT.2019.8849668

One-Shot Perfect Secret Key Agreement for Finite Linear Sources

Chung Chan^*, Navin Kashyap, Praneeth Kumar Vippathalla, Qiaoqiao Zhou

^*Corresponding author for this work

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

2 Citations (Scopus)

Abstract

We consider a non-asymptotic (one-shot) version of the multiterminal secret key agreement problem on a finite linear source model. In this model, the observation of each terminal is a linear function of an underlying random vector composed of finitely many i.i.d. uniform random variables. By restricting the public discussion to be a linear function of the terminals' observations, we obtain a characterization of the communication complexity (minimum number of symbols of public discussion) of generating a secret key of maximum length. More precisely, we show that the minimum discussion can be achieved by a non-interactive protocol in which each terminal first does a linear processing of its own private observations, following which the terminals all execute a discussion-optimal communication-for-omniscience protocol. The secret key can be chosen to be a linear function of the vector of all observations.

Original language	English
Title of host publication	2019 IEEE International Symposium on Information Theory
Subtitle of host publication	PROCEEDINGS
Publisher	IEEE
Pages	947-951
ISBN (Electronic)	978-1-5386-9291-2
ISBN (Print)	978-1-5386-9292-9
DOIs	https://doi.org/10.1109/ISIT.2019.8849668
Publication status	Published - Jul 2019
Event	2019 IEEE International Symposium on Information Theory (ISIT 2019) - La Maison de La Mutualité, Paris, France Duration: 7 Jul 2019 → 12 Jul 2019 https://2019.ieee-isit.org/Papers/ViewSession.asp?Sessionid=1355 https://2019.ieee-isit.org/

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Publisher	IEEE
ISSN (Print)	2157-8095
ISSN (Electronic)	2157-8117

Conference

Conference	2019 IEEE International Symposium on Information Theory (ISIT 2019)
Abbreviated title	ISIT 2019
Place	France
City	Paris
Period	7/07/19 → 12/07/19
Internet address	https://2019.ieee-isit.org/Papers/ViewSession.asp?Sessionid=1355 https://2019.ieee-isit.org/

Access Output

10.1109/ISIT.2019.8849668

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{10924656f21c4554a8d98bce02754ba3,

title = "One-Shot Perfect Secret Key Agreement for Finite Linear Sources",

abstract = "We consider a non-asymptotic (one-shot) version of the multiterminal secret key agreement problem on a finite linear source model. In this model, the observation of each terminal is a linear function of an underlying random vector composed of finitely many i.i.d. uniform random variables. By restricting the public discussion to be a linear function of the terminals' observations, we obtain a characterization of the communication complexity (minimum number of symbols of public discussion) of generating a secret key of maximum length. More precisely, we show that the minimum discussion can be achieved by a non-interactive protocol in which each terminal first does a linear processing of its own private observations, following which the terminals all execute a discussion-optimal communication-for-omniscience protocol. The secret key can be chosen to be a linear function of the vector of all observations.",

author = "Chung Chan and Navin Kashyap and Vippathalla, {Praneeth Kumar} and Qiaoqiao Zhou",

year = "2019",

month = jul,

doi = "10.1109/ISIT.2019.8849668",

language = "English",

isbn = "978-1-5386-9292-9",

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

publisher = "IEEE",

pages = "947--951",

booktitle = "2019 IEEE International Symposium on Information Theory",

address = "United States",

note = "2019 IEEE International Symposium on Information Theory (ISIT 2019), ISIT 2019 ; Conference date: 07-07-2019 Through 12-07-2019",

url = "https://2019.ieee-isit.org/Papers/ViewSession.asp?Sessionid=1355, https://2019.ieee-isit.org/",

}

Chan, C, Kashyap, N, Vippathalla, PK & Zhou, Q 2019, One-Shot Perfect Secret Key Agreement for Finite Linear Sources. in 2019 IEEE International Symposium on Information Theory: PROCEEDINGS., 8849668, IEEE International Symposium on Information Theory - Proceedings, IEEE, pp. 947-951, 2019 IEEE International Symposium on Information Theory (ISIT 2019), Paris, France, 7/07/19. https://doi.org/10.1109/ISIT.2019.8849668

One-Shot Perfect Secret Key Agreement for Finite Linear Sources. / Chan, Chung; Kashyap, Navin; Vippathalla, Praneeth Kumar et al.
2019 IEEE International Symposium on Information Theory: PROCEEDINGS. IEEE, 2019. p. 947-951 8849668 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - One-Shot Perfect Secret Key Agreement for Finite Linear Sources

AU - Chan, Chung

AU - Kashyap, Navin

AU - Vippathalla, Praneeth Kumar

AU - Zhou, Qiaoqiao

PY - 2019/7

Y1 - 2019/7

N2 - We consider a non-asymptotic (one-shot) version of the multiterminal secret key agreement problem on a finite linear source model. In this model, the observation of each terminal is a linear function of an underlying random vector composed of finitely many i.i.d. uniform random variables. By restricting the public discussion to be a linear function of the terminals' observations, we obtain a characterization of the communication complexity (minimum number of symbols of public discussion) of generating a secret key of maximum length. More precisely, we show that the minimum discussion can be achieved by a non-interactive protocol in which each terminal first does a linear processing of its own private observations, following which the terminals all execute a discussion-optimal communication-for-omniscience protocol. The secret key can be chosen to be a linear function of the vector of all observations.

AB - We consider a non-asymptotic (one-shot) version of the multiterminal secret key agreement problem on a finite linear source model. In this model, the observation of each terminal is a linear function of an underlying random vector composed of finitely many i.i.d. uniform random variables. By restricting the public discussion to be a linear function of the terminals' observations, we obtain a characterization of the communication complexity (minimum number of symbols of public discussion) of generating a secret key of maximum length. More precisely, we show that the minimum discussion can be achieved by a non-interactive protocol in which each terminal first does a linear processing of its own private observations, following which the terminals all execute a discussion-optimal communication-for-omniscience protocol. The secret key can be chosen to be a linear function of the vector of all observations.

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85073149053&origin=recordpage

U2 - 10.1109/ISIT.2019.8849668

DO - 10.1109/ISIT.2019.8849668

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 978-1-5386-9292-9

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 947

EP - 951

BT - 2019 IEEE International Symposium on Information Theory

PB - IEEE

T2 - 2019 IEEE International Symposium on Information Theory (ISIT 2019)

Y2 - 7 July 2019 through 12 July 2019

ER -

One-Shot Perfect Secret Key Agreement for Finite Linear Sources

Abstract

Publication series

Conference

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this