The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints
The Gaussian Multiple Access Wire-Tap Channel with Collective Secrecy Constraints
复制标题
DOI：
10.1109/isit.2006.261988
复制
发表时间：
2006-05
期刊：
影响因子：
--
通讯作者：
Ender Tekin;A. Yener
中科院分区：
文献类型：
--
作者：
Ender Tekin;A. Yener
我们考虑高斯多址有线监听信道（GMAC-WT）。在这种情况下，多个用户与预期的接收者进行通信，其中存在一个智能且知情的窃听者，窃听者在接收者处接收降级版本的信号。我们为这种多访问环境定义了合适的安全措施。我们导出了速率区域的外边界，使得在某种预定的程度上可以保持保密性。我们还发现，使用高斯码本，可以实现这样一个保密区域。高斯码字可以实现和容量的外界，并且可实现的区域与高斯码字的外界重合，给出了当输入被约束为高斯时的容量区域。我们给出了显示新速率区域的数值结果，并将其与无保密约束的高斯多址信道（GMAC）的速率区域进行了比较
We consider the Gaussian multiple access wire-tap channel (GMAC-WT). In this scenario, multiple users communicate with an intended receiver in the presence of an intelligent and informed wire-tapper who receives a degraded version of the signal at the receiver. We define a suitable security measure for this multi-access environment. We derive an outer bound for the rate region such that secrecy to some pre-determined degree can be maintained. We also find, using Gaussian codebooks, an achievable such secrecy region. Gaussian codewords are shown to achieve the sum capacity outer bound, and the achievable region coincides with the outer bound for Gaussian codewords, giving the capacity region when inputs are constrained to be Gaussian. We present numerical results showing the new rate region and compare it with that of the Gaussian multiple-access channel (GMAC) with no secrecy constraints