发表机构
Department of Electrical Engineering, Columbia University（哥伦比亚大学电气工程系）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
本文研究多址窃听信道中发射机共享纠缠的安全通信，推导可达速率区域、保密容量正则化表达式及单字母上界，证明纠缠严格提升保密容量，并建立新的强软覆盖引理。
AI 中文摘要
我们研究了经典多址窃听信道（MAC-WTC）上的安全通信，特别探讨了发射机之间共享纠缠的益处。在严格语义安全准则下，我们推导了一个可达速率区域以及保密容量的正则化表达式。我们进一步建立了具有纠缠发射机的MAC-WTC安全容量的单字母上界。我们的结果表明，与仅共享经典相关随机性相比，纠缠严格扩大了MAC-WTC的保密容量，我们通过一个伪远程博弈示例说明了这一发现。最后，我们为具有纠缠发射机的多址信道（MAC）的输出统计建立了新的强软覆盖引理。我们的结果推广了针对非纠缠系统的现有结果。
英文摘要
We investigate secure communication over a classical multiple-access wiretap channel (MAC-WTC), specifically exploring the benefit of shared entanglement between the transmitters. Under the strict semantic security criterion, we derive an achievable rate region and a regularized expression for the secrecy capacity. We further establish a single-letter upper bound on the secure capacity of the MAC-WTC with entangled transmitters. Our results demonstrate that entanglement strictly enlarges the secrecy capacity of MAC-WTC compared to sharing only classical correlated randomness, a finding we illustrate using a pseudo-telepathy game example. Finally, we establish new strong soft-covering lemmas for the output statistics of multipleaccess channels (MACs) with entangled transmitters. Our results generalize existing results for non-entangled systems.
Comments25 pages, 3 figures, two-column, accepted to IEEE Transactions on Information Theory, part of the results will be presented at the 2026 IEEE Information Theory Workshop
