arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.06187cs.ITmath.IT
收藏

基于K-发射机多址信道的联合保密

Joint secrecy over the K-Transmitter Multiple Access Channel

Yanling Chen, O. Ozan Koyluoglu, A. J. Han Vinck

摘要:

本文研究了在有外部窃听者存在的情况下,在K-发射机多址信道上的安全通信问题,受联合保密约束(即,使得从K个消息的集合到窃听者的信息泄漏率为零)。因此,我们建立了联合保密可达速率区域。为此,我们的研究结果建立在两种技术,除了标准的信息理论方法。第一个是一个推广的Chia-El Gamal引理熵界的一组码字的部分信息。第二种方法是利用集合列表的紧凑表示,连同互信息的属性,导致有效的傅里叶-莫茨金消除。在其他情况下,这两种方法也可能具有独立的意义。

英文摘要:

This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K messages to an eavesdropper is made vanishing). As a result, we establish the joint secrecy achievable rate region. To this end, our results build upon two techniques in addition to the standard information-theoretic methods. The first is a generalization of Chia-El Gamal's lemma on entropy bound for a set of codewords given partial information. The second is to utilize a compact representation of a list of sets that, together with properties of mutual information, leads to an efficient Fourier-Motzkin elimination. These two approaches could also be of independent interests in other contexts.

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

↑