【24h】

Covert bits through queues

机译:队列中的隐蔽位

获取原文

摘要

We consider covert communication using a queuing timing channel in the presence of a warden. The covert message is encoded using the inter-arrival times of the packets, and the legitimate receiver and the warden observe the inter-departure times of the packets from their respective queues. The transmitter and the legitimate receiver also share a secret key to facilitate covert communication. We propose achievable schemes that obtain non-zero covert rate for both exponential and general queues when a sufficiently high rate secret key is available. This is in contrast to other channel models such as the Gaussian channel or the discrete memoryless channel where only O(√n) covert bits can be sent over n channel uses, yielding a zero covert rate.
机译:我们考虑在存在看守的情况下使用排队定时通道进行秘密通信。隐式消息是使用数据包的到达间隔时间编码的,合法的接收者和看守从各自的队列中观察数据包的离开间隔时间。发送方和合法接收方还共享一个秘密密钥,以方便秘密通信。我们提出了一种可实现的方案,当有足够高的速率秘密密钥可用时,该方案可以获得指数队列和常规队列的非零秘密率。这与其他通道模型(例如高斯通道或离散无记忆通道)相反,在该模型中,只能在n个通道使用情况下发送O(√n)个隐蔽位,从而产生零隐蔽率。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号