Secrecy capacity region of Gaussian broadcast channel
Secrecy capacity region of Gaussian broadcast channel
复制标题
DOI：
10.1109/ciss.2009.5054708
复制
发表时间：
2009-03
期刊：
影响因子：
--
通讯作者：
Ghadamali Bagherikaram;A. Motahari;A. Khandani
中科院分区：
文献类型：
--
作者：
Ghadamali Bagherikaram;A. Motahari;A. Khandani
在本文中，我们首先考虑这样的场景：源节点希望为两个各自的接收者广播两个机密消息，而线锥也接收所传输的信号。我们假设信号是通过加性高斯白噪声信道传输的。我们刻画了该信道的保密容量区域。我们可实现的编码方案是基于叠加编码和随机入库。我们将该方案称为秘密叠加编码。逆证明结合了传统高斯广播信道的逆证明和完全保密约束。该容量区域与没有安全约束的广播信道的容量区域匹配。它还可以与有线窃听通道的保密容量相匹配。基于安全高斯广播信道的码率特性，我们对慢衰落的线窃听采用了多级编码方法。我们假设发射机只知道窃听者的信道。在该方法中，源节点发送安全分层编码，而接收方被视为一个连续统有序用户。我们推导出了最大化总平均速率的各层的最优功率分配。
In this paper, we first consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-taper also receives the transmitted signal. We assume that the signals are transmitted over additive white Gaussian noise channels. We characterize the secrecy capacity region of this channel. Our achievable coding scheme is based on superposition coding and the random binning. We refer to this scheme as Secret Superposition Coding. The converse proof combines the converse proof for the conventional Gaussian broadcast channel and the perfect secrecy constraint. This capacity region matches the capacity region of the broadcast channel without security constraint. It also matches the secrecy capacity of the wire-tap channel. Based on the rate characterization of the secure Gaussian broadcast channel, we then use a multilevel coding approach for the slowly fading wire-tap. We assume that the transmitter only knows the eavesdropper's channel. In this approach, source node sends secure layered coding and the receiver viewed as a continuum ordered users. We derive optimum power allocation for the layers which maximizes the total average rate.