Chan, C and Kashyap, N and Vippathalla, PK and Zhou, Q (2019) One-Shot Perfect Secret Key Agreement for Finite Linear Sources. In: 2019 IEEE International Symposium on Information Theory, ISIT 2019, 7 - 12 July 2019, Paris, pp. 947-951.
|
PDF
ISIT_2019.pdf - Published Version Download (307kB) | Preview |
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.
| Item Type: | Conference Paper |
|---|---|
| Publication: | IEEE International Symposium on Information Theory - Proceedings |
| Publisher: | Institute of Electrical and Electronics Engineers Inc. |
| Additional Information: | The copyright for this article belongs to the Authors. |
| Keywords: | Information theory, Communication complexity; Linear functions; Linear processing; Non-interactive protocols; Optimal communication; Secret key agreement; Source modeling; Uniform random variables, Cryptography |
| Department/Centre: | Division of Electrical Sciences > Electrical Communication Engineering |
| Date Deposited: | 23 Oct 2022 06:39 |
| Last Modified: | 23 Oct 2022 06:39 |
| URI: | https://eprints.iisc.ac.in/id/eprint/77501 |
Actions (login required)
 |
View Item |
