Reliable, deniable, and hidable communication over multipath networks
Reliable, deniable, and hidable communication over multipath networks
复制标题
通过多路径网络进行可靠、可否认且可隐藏的通信
DOI：
10.1109/isit.2014.6874905
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Alexander Sprintson
中科院分区：
文献类型：
--
作者：
S. Kadhe;S. Jaggi;Mayank Bakshi;Alexander Sprintson
我们考虑这样的场景，其中发送器Alice想要（潜在地）通过多路径网络与预期接收器Bob通信，即，由多个并行链路组成的网络，存在一个被动窃听者Willie，他观察链路的未知子集。我们的通信协议的主要目标是使通信“可否认”，即，威利不应该能够可靠地估计爱丽丝是否正在向鲍勃发送任何秘密信息。此外，如果爱丽丝确实在积极沟通，她的秘密信息应该是信息理论上的“隐藏”，在这个意义上，威利的观察不应该泄露任何关于爱丽丝的（潜在的）信息给鲍勃-我们的概念隐藏性略强于信息理论强保密性的概念在文献中得到了很好的研究。我们证明，可否认性并不意味着隐藏性或（弱或强）信息理论的秘密，也不意味着可否认性信息理论的秘密。我们提出了匹配的内部和外部界限的能力，可否认和隐藏的通信多路径网络。
We consider the scenario wherein a transmitter Alice wants to (potentially) communicate to the intended receiver Bob over a multipath network, i.e., a network consisting of multiple parallel links, in the presence of a passive eavesdropper Willie, who observes an unknown subset of links. A primary goal of our communication protocol is to make the communication “deniable”, i.e., Willie should not be able to reliably estimate whether or not Alice is transmitting any covert information to Bob. Moreover, if Alice is indeed actively communicating, her covert messages should be information-theoretically “hidable” in the sense that Willie's observations should not leak any information about Alice's (potential) message to Bob - our notion of hidability is slightly stronger than the notion of information-theoretic strong secrecy well-studied in the literature. We demonstrate that deniability does not imply either hidability or (weak or strong) information-theoretic secrecy; nor does information-theoretic secrecy imply deniability. We present matching inner and outer bounds on the capacity for deniable and hidable communication over multipath networks.