Implementation of Oblivious Transfer over Binary-Input AWGN Channels by Polar Codes
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866914325371813888 |
|---|---|
| author | Lin, Pin-Hsun Aghaee, Hadi Deppe, Christian Jorswieck, Eduard A. Boche, Holger |
| author_facet | Lin, Pin-Hsun Aghaee, Hadi Deppe, Christian Jorswieck, Eduard A. Boche, Holger |
| contents | We develop a one-out-of-two oblivious transfer protocol over the binary-input additive white Gaussian noise (BI-AWGN) channel using polar codes. The scheme uses two decoder views linked by automorphisms of the polar transform and publicly draws the encoder at random from the corresponding automorphism group. This yields perfect secrecy for Bob at any blocklength. Secrecy for Alice is obtained asymptotically via channel polarization combined with privacy amplification. Because the construction deliberately injects randomness into selected bad bit-channels, we derive a relaxed reliability criterion, which is empirically certified via Monte-Carlo simulations. We also evaluate finite-blocklength performance. Finally, we characterize the polar-transform automorphisms as bit-level permutations of bit-channel indices, and exploit this structure to derive and optimize an achievable finite-blocklength rate. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_10682 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Implementation of Oblivious Transfer over Binary-Input AWGN Channels by Polar Codes Lin, Pin-Hsun Aghaee, Hadi Deppe, Christian Jorswieck, Eduard A. Boche, Holger Information Theory We develop a one-out-of-two oblivious transfer protocol over the binary-input additive white Gaussian noise (BI-AWGN) channel using polar codes. The scheme uses two decoder views linked by automorphisms of the polar transform and publicly draws the encoder at random from the corresponding automorphism group. This yields perfect secrecy for Bob at any blocklength. Secrecy for Alice is obtained asymptotically via channel polarization combined with privacy amplification. Because the construction deliberately injects randomness into selected bad bit-channels, we derive a relaxed reliability criterion, which is empirically certified via Monte-Carlo simulations. We also evaluate finite-blocklength performance. Finally, we characterize the polar-transform automorphisms as bit-level permutations of bit-channel indices, and exploit this structure to derive and optimize an achievable finite-blocklength rate. |
| title | Implementation of Oblivious Transfer over Binary-Input AWGN Channels by Polar Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2601.10682 |