2014/01/17 by Swanand Kadhe, Kadhe, Swanand, Sidharth Jaggi +5
Computer Science · Engineering · #Cooperative Communication and Network Coding #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.1401.4451
openalex publication_date 2014/01/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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. We present matching inner and outer bounds on the capacity for deniable and hidable communication over \it multipath networks.