Covert Communication over Adversarially Jammed Channels
Covert Communication over Adversarially Jammed Channels
复制标题
通过敌对堵塞的渠道进行秘密通信
DOI：
10.1109/itw.2018.8613405
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
S. Jaggi
中科院分区：
文献类型：
--
作者：
Q. Zhang;Mayank Bakshi;S. Jaggi
假设发射机Alice潜在地希望通过对抗性干扰的二进制信道与接收机Bob通信。一个活跃的对手詹姆斯窃听他们的通信在一个二进制对称信道（BSC$（q）），并可能恶意翻转（高达）的某个分数p他们的传输位的基础上，他的观察。我们考虑一种通信必须同时隐蔽和可靠的环境，即，詹姆斯应该无法准确区分爱丽丝是否在通信，而鲍勃应该能够正确地恢复爱丽丝的消息，无论对抗性干扰策略如何。我们表明，与被动对手的设置，可靠的隐蔽通信对主动对手需要爱丽丝和鲍勃有一个共享的密钥（长度至少为$\欧米茄$（log $n）$），即使鲍勃有一个更好的渠道比詹姆斯。我们提出的信息理论上的最优吞吐量的通道参数，所需的隐蔽性水平，和可用的共享密钥的量的函数的内部和外部边界。此外，这些边界匹配广泛的参数。完整版本[1]：https://arxiv.org/pdf/1805.02426.pdf
Suppose that a transmitter Alice potentially wishes to communicate with a receiver Bob over an adversarially jammed binary channel. An active adversary James eavesdrops on their communication over a binary symmetric channel (BSC$(q))$, and may maliciously flip (up to) a certain fraction p of their transmitted bits based on his observation. We consider a setting where the communication must be simultaneously covert as well as reliable, i.e., James should be unable to accurately distinguish whether or not Alice is communicating, while Bob should be able to correctly recover Alice’s message with high probability regardless of the adversarial jamming strategy. We show that, unlike the setting with passive adversaries, reliable covert communication against active adversaries requires Alice and Bob to have a shared key (of length at least $\Omega$(log $n)$) even when Bob has a better channel than James. We present inner and outer bounds on the information-theoretically optimal throughputs as a function of the channel parameters, the desired level of covertness, and the amount of shared key available. Further, these bounds match for a wide range of parameters of interest. Full version [1]: https://arxiv.org/pdf/1805.02426.pdf
影响因子：
2.5
作者：
Zhang, Yihan;Vatedka, Shashank;Jaggi, Sidharth;Sarwate, Anand D.
通讯作者：
Sarwate, Anand D.