On the Existence of Perfect Stegosystems

Korzhik, Valery; Morales‐Luna, Guillermo; Lee, Moon Ho

doi:10.1007/11551492_3

Cited by 18 publications

(14 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We note that the results of[2] and[3] were developed independently of[17]. While[17] provides the proof of the SRL when Alice is average-power constrained,[2] and[3] also develop the achievability of SRL for the peakpower constained covert communication and the converse to the SRL.…”

mentioning

confidence: 99%

Covert Communication in the Presence of an Uninformed Jammer

Sobers

Bash

Guha

et al. 2017

IEEE Trans. Wireless Commun.

317

203

View full text Add to dashboard Cite

Recent work has established that when transmitter Alice wishes to communicate reliably to recipient Bob without detection by warden Willie, with additive white Gaussian noise (AWGN) channels between all parties, communication is limited to O( √ n) bits in n channel uses. However, this assumes Willie has an accurate statistical characterization of the channel. When Willie has uncertainty about such and his receiver is limited to a threshold test on the received power, Alice can transmit covertly with a power that does not decrease with n, thus conveying O(n) bits covertly and reliably in n uses of an AWGN channel. Here, we consider covert communication of O(n) bits in n channel uses while generalizing the environment and removing any restrictions on Willie's receiver. We assume an uninformed "jammer" is present to help Alice, and we consider AWGN and block fading channels. In some scenarios, Willie's optimal detector is a threshold test on the received power. When the channel between the jammer and Willie has multiple fading blocks per codeword, a threshold test on the received power is not optimal. However, we establish that Alice can remain covert with a transmit power that does not decrease with n even when Willie employs an optimal detector.

show abstract

mentioning

confidence: 99%

Covert Communication in the Presence of an Uninformed Jammer

Sobers

Bash

Guha

et al. 2017

IEEE Trans. Wireless Commun.

317

203

View full text Add to dashboard Cite

show abstract

“…The extra log n factor is because of the lack of noise in the steganography context. However, arguably the earliest work on SRL [35] shows its achievability without the log n factor in the presence of an "active" adversary that corrupts stegotext using AWGN. This was re-discovered independently and published with the converse in [3], [4].…”

Section: A Relationship With Steganographymentioning

confidence: 99%

Covert Communication Gains From Adversary’s Ignorance of Transmission Time

Bash

Goeckel

Towsley

2016

IEEE Trans. Wireless Commun.

119

View full text Add to dashboard Cite

The recent square root law (SRL) for covert communication demonstrates that Alice can reliably transmit O( √ n) bits to Bob in n uses of an additive white Gaussian noise (AWGN) channel while keeping ineffective any detector employed by the adversary; conversely, exceeding this limit either results in detection by the adversary with high probability or non-zero decoding error probability atBob. This SRL is under the assumption that the adversary knows when Alice transmits (if she transmits); however, in many operational scenarios he does not know this. Hence, here we study the impact of the adversary's ignorance of the time of the communication attempt. We employ a slotted AWGN channel model with T (n) slots each containing n symbol periods, where Alice may use a single slot out of B. A. Bash is with Raytheon BBN Technologies,

show abstract

“…Recall the assumption in Theorem 1 that no distribution P satisfying (7) can be found. In this case, one can verify that there is no loss of optimality in discarding all x such that σ(x) = σ(0).…”

Section: A Conversementioning

confidence: 99%

“…With (38), we can fixρ n and compute the first and second derivatives of the left-hand side of (33) with respect to α n , using, e.g., [12,Theorem 11.9] and [13, (7)]. At α n = 0, the first derivative equals zero, and the second derivative is η(ρ n ρ(0)), yielding (see Lemma 1 in the Appendix for details)…”

Section: A Conversementioning

confidence: 99%

Optimal throughput for covert communication over a classical-quantum channel

Wang

2016

2016 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

This paper considers the problem of communication over a memoryless classical-quantum wiretap channel subject to the constraint that the eavesdropper on the channel should not be able to learn with high confidence whether the legitimate parties are using the channel to communicate or not. Specifically, the relative entropy between the output quantum states at the eavesdropper when a codeword is transmitted and when no input is provided must be sufficiently small. Extending earlier works, this paper proves the "square-root law" for a broad class of classical-quantum channels: the maximum amount of information that can be reliably and covertly transmitted over n uses of such a channel scales like √ n. The scaling constant is also determined.

show abstract

On the Existence of Perfect Stegosystems

Cited by 18 publications

References 6 publications

Covert Communication in the Presence of an Uninformed Jammer

Covert Communication in the Presence of an Uninformed Jammer

Covert Communication Gains From Adversary’s Ignorance of Transmission Time

Optimal throughput for covert communication over a classical-quantum channel

Contact Info

Product

Resources

About