ARQ-Based Secret Key Sharing
| dc.creator | Ghany, Mohamed Abdel | |
| dc.creator | Sultan, Ahmed | |
| dc.creator | Gamal, Hesham El | |
| dc.date | 2008-10-07 | |
| dc.date.accessioned | 2026-07-07T10:08:26Z | |
| dc.date.available | 2026-07-07T10:08:26Z | |
| dc.description | This paper develops a novel framework for sharing secret keys using existing Automatic Repeat reQuest (ARQ) protocols. Our approach exploits the multi-path nature of the wireless environment to hide the key from passive eavesdroppers. The proposed framework does not assume the availability of any prior channel state information (CSI) and exploits only the one bit ACK/NACK feedback from the legitimate receiver. Compared with earlier approaches, the main innovation lies in the distribution of key bits among multiple ARQ frames. Interestingly, this idea allows for achieving a positive secrecy rate even when the eavesdropper experiences more favorable channel conditions, on average, than the legitimate receiver. In the sequel, we characterize the information theoretic limits of the proposed schemes, develop low complexity explicit implementations, and conclude with numerical results that validate our theoretical claims. | |
| dc.identifier | https://arxiv.org/abs/0810.1319 | |
| dc.identifier | http://arxiv.org/abs/0810.1319 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/170996 | |
| dc.subject | Information Theory | |
| dc.subject | Cryptography and Security | |
| dc.subject | H.1.1; E.4; K.4.4; K.6.5 | |
| dc.title | ARQ-Based Secret Key Sharing | |
| dc.type | text |