arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0810.1319cs.ITcs.CRmath.IT
收藏

基于ARQ的秘密密钥共享

ARQ-Based Secret Key Sharing

Mohamed Abdel Ghany, Ahmed Sultan, Hesham El Gamal

摘要:

本文提出了一种新的框架共享密钥使用现有的自动重传请求(ARQ)协议。我们的方法利用无线环境的多路径特性来隐藏被动窃听者的密钥。所提出的框架不假设任何先前的信道状态信息(CSI)的可用性,并利用只有一个比特的ACK/NACK反馈从合法的接收机。与以前的方法相比,主要的创新在于在多个ARQ帧之间分配关键比特。有趣的是,这个想法允许实现一个积极的保密率,即使窃听者经历更有利的信道条件,平均而言,比合法的接收器。在续集中,我们描述了所提出的计划的信息理论的限制,开发低复杂度的显式实现,并得出结论,验证了我们的理论主张的数值结果。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑