...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Covert Communication Over Noisy Channels: A Resolvability Perspective
【24h】

Covert Communication Over Noisy Channels: A Resolvability Perspective

机译：嘈杂通道上的秘密通信：可解决性的观点

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We consider the situation in which a transmitter attempts to communicate reliably over a discrete memoryless channel, while simultaneously ensuring covertness (low probability of detection) with respect to a warden, who observes the signals through another discrete memoryless channel. We develop a coding scheme based on the principle of channel resolvability, which generalizes and extends prior work in several directions. First, it shows that irrespective of the quality of the channels, it is possible to communicate on the order of reliable and covert bits over channel uses if the transmitter and the receiver share on the order of key bits. This improves upon earlier results requiring on the order of key bits. Second, it proves that if the receiver’s channel is better than the warden’s channel in a sense that we make precise, it is possible to communicate on the order of reliable and covert bits over channel uses without a secret key. This generalizes earlier results established for binary symmetric channels. We also identify the fundamental limits of covert and secret communications in terms of the optimal asymptotic scaling of the message size and key size, and we extend the analysis to Gaussian channels. The main technical problem that we address is how to develop concentration inequalities for low-weight sequences. The crux of our approach is to define suitably modified typical sets that are amenable to concentration inequalities.
机译：我们考虑这样一种情况，即发射机尝试通过离散的无记忆通道进行可靠的通信，同时确保相对于看守的隐蔽性（检测概率低），该监护人通过另一个离散的无记忆通道观察信号。我们基于信道可分辨性原理开发了一种编码方案，该方案在多个方向上概括并扩展了先前的工作。首先，它表明，不管信道的质量如何，如果发送方和接收方共享密钥位的顺序，则可以在信道使用上以可靠和隐蔽位的顺序进行通信。这改善了要求密钥位顺序的早期结果。其次，证明从我们精确的角度来说，如果接收者的信道比监护人的信道好，则可以在没有秘密密钥的情况下，以可靠和隐蔽的比特数顺序进行信道使用通信。这概括了为二进制对称信道建立的较早结果。我们还根据消息大小和密钥大小的最佳渐近缩放来确定秘密通信和秘密通信的基本限制，并将分析范围扩展到高斯信道。我们要解决的主要技术问题是如何为低权重序列建立浓度不等式。我们方法的症结在于定义适合浓度不等式的适当修改的典型集合。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号