1,574 research outputs found
Fundamental Limits of Communication with Low Probability of Detection
This paper considers the problem of communication over a discrete memoryless
channel (DMC) or an additive white Gaussian noise (AWGN) channel subject to the
constraint that the probability that an adversary who observes the channel
outputs can detect the communication is low. Specifically, the relative entropy
between the output distributions when a codeword is transmitted and when no
input is provided to the channel must be sufficiently small. For a DMC whose
output distribution induced by the "off" input symbol is not a mixture of the
output distributions induced by other input symbols, it is shown that the
maximum amount of information that can be transmitted under this criterion
scales like the square root of the blocklength. The same is true for the AWGN
channel. Exact expressions for the scaling constant are also derived.Comment: Version to appear in IEEE Transactions on Information Theory; minor
typos in v2 corrected. Part of this work was presented at ISIT 2015 in Hong
Kon
Fundamental limits of quantum-secure covert optical sensing
We present a square root law for active sensing of phase of a single
pixel using optical probes that pass through a single-mode lossy thermal-noise
bosonic channel. Specifically, we show that, when the sensor uses an -mode
covert optical probe, the mean squared error (MSE) of the resulting estimator
scales as ; improving the
scaling necessarily leads to detection by the adversary with high probability.
We fully characterize this limit and show that it is achievable using laser
light illumination and a heterodyne receiver, even when the adversary captures
every photon that does not return to the sensor and performs arbitrarily
complex measurement as permitted by the laws of quantum mechanics.Comment: 13 pages, 1 figure, submitted to ISIT 201
Optimal Throughput for Covert Communication Over a Classical-Quantum Channel
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 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 uses of such a channel scales
like . The scaling constant is also determined.Comment: Corrected version of a paper presented at ITW 2016. In the ITW paper,
the denominator in the main formula (10) was incorrect. The current version
corrects this mistake and adds an appendix for its derivatio
Covert Wireless Communication with a Poisson Field of Interferers
In this paper, we study covert communication in wireless networks consisting
of a transmitter, Alice, an intended receiver, Bob, a warden, Willie, and a
Poisson field of interferers. Bob and Willie are subject to uncertain shot
noise due to the ambient signals from interferers in the network. With the aid
of stochastic geometry, we analyze the throughput of the covert communication
between Alice and Bob subject to given requirements on the covertness against
Willie and the reliability of decoding at Bob. We consider non-fading and
fading channels. We analytically obtain interesting findings on the impacts of
the density and the transmit power of the concurrent interferers on the covert
throughput. That is, the density and the transmit power of the interferers have
no impact on the covert throughput as long as the network stays in the
interference-limited regime, for both the non-fading and the fading cases. When
the interference is sufficiently small and comparable with the receiver noise,
the covert throughput increases as the density or the transmit power of the
concurrent interferers increases
- …