Variable-Length Secret Key Agreement via Random Stopping Time

We consider a key agreement setting where two parties observe correlated random sources, and want to agree on a secret key via public discussions. In order to allow the key length to adapt to the realizations of the random sources, we allow the key to be of variable length, subject to a novel variab...

Full description

Saved in:
Bibliographic Details
Published inProceedings / IEEE International Symposium on Information Theory pp. 315 - 320
Main Authors Zhou, Junda, Li, Cheuk Ting
Format Conference Proceeding
LanguageEnglish
Published IEEE 07.07.2024
Subjects
Computational efficiency
Generators
Huffman coding
Source coding
Online AccessGet full text
ISSN2157-8117
DOI10.1109/ISIT57864.2024.10619602

Cover

More Information
Summary:We consider a key agreement setting where two parties observe correlated random sources, and want to agree on a secret key via public discussions. In order to allow the key length to adapt to the realizations of the random sources, we allow the key to be of variable length, subject to a novel variable-length version of the uniformity constraint based on random stopping time. We propose simple, computationally efficient key agreement schemes under the new constraint. The proposed scheme can be considered as the key agreement analogue of variable-length source coding via Huffman coding, and the Knuth-Yao random number generator.
ISSN:2157-8117
DOI:10.1109/ISIT57864.2024.10619602