论文标题
使用任意数量的用户的可扩展安全性干扰通道
Towards Scalable Security in Interference Channels With Arbitrary Number of Users
论文作者
论文摘要
在本文中，我们为具有任意数量的用户的干扰渠道提供了可实现的安全方案。在此模型中，每个接收方应能够解码其预期消息，而它无法解码有关其他接收器的任何有意义的信息。我们的计划实现了个人安全利率，该费率与日志（SNR）线性缩放，并实现了总和的总率，该速率在总和安全容量的恒定差距之内。为了在发射机侧设计编码器，我们将嵌套的晶格编码结合在一起，随机I.I.D.代码和合作干扰技术。不对称的计算框架用于在接收器上执行解码操作。我们方案的新颖性是，对于此安全方案，它是第一个渐近最佳的可实现方案，该方案可扩展到任意数量的用户，并适用于任何有限价值的SNR。同样，我们的计划在不使用外部助手的情况下实现了上限和$ 1 $的上限安全度。
In this paper, we present an achievable security scheme for an interference channel with arbitrary number of users. In this model, each receiver should be able to decode its intended message while it cannot decode any meaningful information regarding messages intended for other receivers. Our scheme achieves individual secure rates which scale linearly with log(SNR) and achieves sum secure rates which is within constant gap of sum secure capacity. To design the encoders at the transmitters side, we combine nested lattice coding, random i.i.d. codes, and cooperative jamming techniques. Asymmetric compute-and-forward framework is used to perform the decoding operation at the receivers. The novelty of our scheme is that it is the first asymptotically optimal achievable scheme for this security scenario which scales to arbitrary number of users and works for any finite-valued SNR. Also, our scheme achieves the upper bound sum secure degrees of freedom of $1$ without using external helpers.
