Polar Coding for Secure Transmission and Key Agreement

Polar Coding for Secure Transmission and Key Agreement
复制标题

DOI:
10.1109/tifs.2012.2207382
复制
发表时间:
2012-10
影响因子:
6.8
通讯作者:
O. O. Koyluoglu-O.;H. E. Gamal
O. O. Koyluoglu-O.;H. E. Gamal
中科院分区:
计算机科学1区
文献类型:
--
作者:
O. O. Koyluoglu-O.;H. E. Gamal

文献摘要

被引文献

相似文献

实现具有实际编码复杂度的信息理论安全性是有一定意义的。这项工作首先集中在关键协议的问题。针对这一问题,提出了一种新的块衰落信道下的跨层安全编码协议。该方案只需要窃听者的信道状态信息(CSI)的统计知识,并利用隐私放大技术,减少了问题的密钥协议的可证明安全的编码问题,每块。针对这个安全编码问题,Arikan提出的极化码在二进制输入降级窃听信道中实现了非零的完美保密率,同时具有非常低的编解码复杂度。我们进一步表明,在对称的主信道和窃听信道的特殊情况下,这种编码技术实现的保密能力。这种方法也被扩展到多址信道与降级的窃听者建立一个非平凡的可实现的保密区域。然后在所提出的密钥协商协议中利用这种极化编码方法,其中每个块的安全编码用于为合法节点创建优于窃听者的优势,然后通过隐私放大模块将其变成私钥。
Achieving information theoretic security with practical coding complexity is of definite interest. This work first focuses on the key agreement problem. For this problem, a new cross-layer secure coding protocol over block fading channels is proposed. The proposed scheme requires only the statistical knowledge about the eavesdropper channel state information (CSI), and, utilizing a privacy amplification technique, reduces the problem of key agreement to a provably secure coding problem per block. Focusing on this secure coding problem, it is shown that polar codes, introduced by Arikan, achieve nonzero perfect secrecy rates for the binary-input degraded wiretap channel while enjoying a remarkably low encoding-decoding complexity. We further show that, in the special case of symmetric main and eavesdropper channels, this coding technique achieves the secrecy capacity. This approach is also extended to the multiple-access channel with a degraded eavesdropper where a nontrivial achievable secrecy region is established. This polar coding method is then utilized in the proposed key agreement protocol, where the secure coding per block is used to create an advantage for the legitimate nodes over the eavesdropper, which is then turned into a private key via the privacy amplification module.