Capacity Region for Covert Secret Key Generation over Multiple Access Channels
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908306823446528 |
|---|---|
| author | Zhang, Yingxin Zhou, Lin Zhang, Qiaosheng |
| author_facet | Zhang, Yingxin Zhou, Lin Zhang, Qiaosheng |
| contents | We study covert secret key generation over a binary-input two-user multiple access channel with one-way public discussion and derive bounds on the capacity region. Specifically, in this problem, there are three legitimate parties: Alice, Bob and Charlie. The goal is to allow Charlie to generate a secret key with Alice and another secret key with Bob, reliably, secretly and covertly. Reliability ensures that the key generated by Alice and Charlie is the same and the key generated by Bob and Charlie is the same. Secrecy ensures that the secret keys generated are only known to specific legitimate parties. Covertness ensures that the key generation process is undetectable by a warden Willie. As a corollary of our result, we establish bounds on the capacity region of wiretap secret key generation without the covertness constraint and discuss the impact of covertness. Our results generalize the point-to-point result of Tahmasbi and Bloch (TIFS 2020) to the setting of multiterminal communication. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2504_05828 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Capacity Region for Covert Secret Key Generation over Multiple Access Channels Zhang, Yingxin Zhou, Lin Zhang, Qiaosheng Information Theory We study covert secret key generation over a binary-input two-user multiple access channel with one-way public discussion and derive bounds on the capacity region. Specifically, in this problem, there are three legitimate parties: Alice, Bob and Charlie. The goal is to allow Charlie to generate a secret key with Alice and another secret key with Bob, reliably, secretly and covertly. Reliability ensures that the key generated by Alice and Charlie is the same and the key generated by Bob and Charlie is the same. Secrecy ensures that the secret keys generated are only known to specific legitimate parties. Covertness ensures that the key generation process is undetectable by a warden Willie. As a corollary of our result, we establish bounds on the capacity region of wiretap secret key generation without the covertness constraint and discuss the impact of covertness. Our results generalize the point-to-point result of Tahmasbi and Bloch (TIFS 2020) to the setting of multiterminal communication. |
| title | Capacity Region for Covert Secret Key Generation over Multiple Access Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2504.05828 |