Reliable deniable communication with channel uncertainty

Hou, Pak; Bakshi, Mayank; Chan, Chung; Jaggi, Sidharth

doi:10.1109/itw.2014.6970786

Cited by 75 publications

(44 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work of [5], [6] motivated significant further work (e.g. [7]- [19]), with these works taken together providing an almost complete characterization of the foundational limits of covert communications over discrete memoryless channels (DMCs) and AWGN channels.…”

Section: Introductionmentioning

confidence: 99%

Covert communications on Poisson packet channels

Soltani

Goeckel

Towsley

et al. 2015

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

Consider a channel where authorized transmitter Jack sends packets to authorized receiver Steve according to a Poisson process with rate λ packets per second for a time period T . Suppose that covert transmitter Alice wishes to communicate information to covert receiver Bob on the same channel without being detected by a watchful adversary Willie. We consider two scenarios. In the first scenario, we assume that warden Willie cannot look at packet contents but rather can only observe packet timings, and Alice must send information by inserting her own packets into the channel. We show that the number of packets that Alice can covertly transmit to Bob is on the order of the square root of the number of packets that Jack transmits to Steve; conversely, if Alice transmits more than that, she will be detected by Willie with high probability. In the second scenario, we assume that Willie can look at packet contents but that Alice can communicate across an M/M/1 queue to Bob by altering the timings of the packets going from Jack to Steve. First, Alice builds a codebook, with each codeword consisting of a sequence of packet timings to be employed for conveying the information associated with that codeword. However, to successfully employ this codebook, Alice must always have a packet to send at the appropriate time. Hence, leveraging our result from the first scenario, we propose a construction where Alice covertly slows down the packet stream so as to buffer packets to use during a succeeding codeword transmission phase. Using this approach, Alice can covertly and reliably transmit O(λT ) covert bits to Bob in time period T over an M/M/1 queue with service rate µ > λ.

show abstract

Section: Introductionmentioning

confidence: 99%

Covert communications on Poisson packet channels

Soltani

Goeckel

Towsley

et al. 2015

2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)

View full text Add to dashboard Cite

show abstract

“…Computable single-letter formulas for the maximum achievable covert-communication rate (assuming that a sufficiently long key is available) have been derived. This work, from a different perspective to that of recent works [5]- [7], shows that channel statistics unknown to the warden can help the communicating parties to communicate covertly.…”

Section: Discussionmentioning

confidence: 72%

Covert Communication With Channel-State Information at the Transmitter

Lee

Wang

Khisti

et al. 2018

IEEE Trans.Inform.Forensic Secur.

View full text Add to dashboard Cite

We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here, "covert" means that a warden on the channel should observe similar statistics when the transmitter is sending a message and when it is not. When a sufficiently long secret key is shared between the transmitter and the receiver, we derive closed-form formulas for the maximum achievable covert communication rate ("covert capacity") for discrete memoryless channels and, when the transmitter's channel-state information (CSI) is noncausal, for additive white Gaussian noise (AWGN) channels. For certain channel models, including the AWGN channel, we show that the covert capacity is positive with CSI at the transmitter, but is zero without CSI. We also derive lower bounds on the rate of the secret key that is needed for the transmitter and the receiver to achieve the covert capacity.

show abstract

“…We now derive an available transmit power of the LNs that makes it possible to achieve the desired throughput scaling while satisfying the covertness constraint in (4). Because each LN uses a codebook generated according to the distribution CN (0, P MH ), the covertness measure in (4) at WN i is upper bounded as follows:…”

Section: ) Transmit Power P Mhmentioning

confidence: 99%

Throughput Scaling of Covert Communication over Wireless Adhoc Networks

Cho

Lee

Tan

2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

We consider the problem of covert communication over wireless adhoc networks in which (roughly) n legitimate nodes (LNs) and n κ for 0 < κ < 1 non-communicating warden nodes (WNs) are randomly distributed in a square of unit area. Each legitimate source wants to communicate with its intended destination node while ensuring that every WN is unable to detect the presence of the communication. In this scenario, we study the throughput scaling law. Due the covert communication constraint, the transmit powers are necessarily limited. Under this condition, we introduce a preservation region around each WN. This region serves to prevent transmission from the LNs and to increase the transmit power of the LNs outside the preservation regions. For the achievability results, multi-hop (MH), hierarchical cooperation (HC), and hybrid HC-MH schemes are utilized with some appropriate modifications. In the proposed MH and hybrid schemes, because the preservation regions may impede communication along direct data paths, the data paths are suitably modified by taking a detour around each preservation region. To avoid the concentration of detours resulting extra relaying burdens, we distribute the detours evenly over a wide region. In the proposed HC scheme, we control the symbol power and the scheduling of distributed multiple-input multiple-output transmission. We also present matching upper bounds on the throughput scaling under the assumption that every active LN consumes the same average transmit power over the time period in which the WNs observe the channel outputs.Index Terms-Covert communication, low probability of detection, wireless adhoc networks, capacity scaling law.

show abstract

Reliable deniable communication with channel uncertainty

Cited by 75 publications

References 6 publications

Covert communications on Poisson packet channels

Covert communications on Poisson packet channels

Covert Communication With Channel-State Information at the Transmitter

Throughput Scaling of Covert Communication over Wireless Adhoc Networks

Contact Info

Product

Resources

About