Reliable, Deniable, and Hidable Communication over Multipath Networks

Understand

We consider the scenario wherein Alice wants to (potentially) communicate to the intended receiver Bob over 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", {\it i.e.}, Willie should not be able to {\it reliably} estimate whether or not Alice is transmitting any {\it 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 {\it 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, and may be of independent interest.
• It can be shown that deniability does not imply either hidability or (weak or strong) information-theoretic secrecy; nor does any form of information-theoretic secrecy imply deniability.