Papers
Topics
Authors
Recent
Search
2000 character limit reached

Covert Optical Communication

Published 29 Apr 2014 in cs.IT, math.IT, and quant-ph | (1404.7347v4)

Abstract: Encryption prevents unauthorized decoding, but does not ensure stealth---a security demand that a mere presence of a message be undetectable. We characterize the ultimate limit of covert communication that is secure against the most powerful physically-permissible adversary. We show that, although it is impossible over a pure-loss channel, covert communication is attainable in the presence of any excess noise, such as a $300$K thermal blackbody. In this case, $\mathcal{O}(\sqrt{n})$ bits can be transmitted reliably and covertly in $n$ optical modes using standard optical communication equipment. The all-powerful adversary may intercept all transmitted photons not received by the intended receiver, and employ arbitrary quantum memory and measurements. Conversely, we show that this square root scaling cannot be outperformed. We corroborate our theory in a proof-of-concept experiment. We believe that our findings will enable practical realizations of covert communication and sensing, both for point-to-point and networked scenarios.

Citations (108)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.