Fetching the paper…
Reading the bibliography…
The recent square root law (SRL) for covert communication demonstrates that Alice can reliably transmit $\mathcal{O}(\sqrt{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 at Bob.
C. E. Shannon, “Communication theory of secrecy systems,” Bell System Technical Journal , vol. 28, pp. 656–715, 1949
1949
Earlier work this paper cites.
M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications Handbook . McGraw-Hill, 1994
1994
Earlier work this paper cites.
P. Billingsley, Probability and Measure , 3rd ed. New York: Wiley, 1995
1995
Earlier work this paper cites.
A. J. Menezes, S. A. Vanstone, and P. C. V. Oorschot, Handbook of Applied Cryptography . Boca Raton, FL, USA: CRC Press, Inc., 1996
1996
Earlier work this paper cites.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms , 2nd ed. Cambridge, Massachusetts: MIT Press, 2001
2001
Earlier work this paper cites.
T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. John Wiley & Sons, Hoboken, NJ, 2002
2002
Earlier work this paper cites.
M. Chiani, D. Dardari, and M. K. Simon, “New exponential bounds and approximations for the computation of error probability in fading channels,” IEEE Trans. Wireless Commun. , vol. 2, no. 4, pp. 840–845, Jul. 2003
2003
Earlier work this paper cites.
S. Dasgupta and A. Gupta, “An Elementary Proof of a Theorem of Johnson and Lindenstrauss,” Random Struct. Algorithms , vol. 22, no. 1, pp. 60–65, Jan. 2003
2003
Earlier work this paper cites.
S. Boyd and L. Vandenberghe, Convex Optimization . New York, NY, USA: Cambridge University Press, 2004
2004
Earlier work this paper cites.
F. Topsøe, “Some bounds for the logarithmic function,” RGMIA Research Rep. Collection , vol. 7, no. 2, 2004
2004
Earlier work this paper cites.
E. Lehmann and J. Romano, Testing Statistical Hypotheses , 3rd ed. New York: Springer, 2005
2005
Earlier work this paper cites.
D. Torrieri, Principles of Spread-spectrum Communication Systems . Boston, MA, USA: Springer, 2005
2005
Earlier work this paper cites.
V. Korzhik, G. Morales-Luna, and M. H. Lee, “On the existence of perfect stegosystems,” in Proc. 4th Int. Workshop Digital Watermarking (IWDW) , Siena, Italy, Sep. 2005, pp. 30–38
2005
Earlier work this paper cites.
——, “Batch steganography and pooled steganalysis,” in Proc. Int. Inform. Hiding Workshop , Alexandria, VA, 2006, pp. 265–281
2006
Cited alongside, same era.
A. D. Ker, “A capacity result for batch steganography,” IEEE Signal Process. Lett. , vol. 14, no. 8, pp. 525–528, Aug. 2007
2007
Cited alongside, same era.
U. Madhow, Fundamentals of Digital Communication . Cambridge, UK: Cambridge University Press, 2008
2008
Cited alongside, same era.
J. Fridrich, Steganography in Digital Media: Principles, Algorithms, and Applications , 1st ed. New York: Cambridge University Press, 2009
2009
Cited alongside, same era.
A. D. Ker, “The square root law does not require a linear key,” in Proc. ACM Workshop Multimedia Security , Roma, Italy, 2010, pp. 213–224
2010
Cited alongside, same era.
R. Soltani, B. A. Bash, D. Goeckel, S. Guha, and D. Towsley, “Covert single-hop communication in a wireless network with distributed artificial noise generation,” in Proc. Conf. Commun. Control Comp. (Allerton) , Monticello, IL, 2014
2014
Closest in time.
2014
Closest in time.
T. S. Han, H. Endo, and M. Sasaki, “Reliability and secrecy functions of the wiretap channel under cost constraint,” IEEE Trans. Inf. Theory , vol. 60, no. 11, pp. 6819–6843, Nov 2014
2014
Closest in time.
P. H. Che, M. Bakshi, C. Chan, and S. Jaggi, “Reliable deniable communication with channel uncertainty,” in Proc. Inform. Theory Workshop (ITW) , Hobart, Tasmania, Australia, Nov 2014, pp. 30–34
2014
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
S. Craver and J. Yu, “Subset selection circumvents the square root law,” in Proc. SPIE Media Forensics Security , San Jose, CA, 2010, pp. 754 103–1–754 103–6
2010
Cited alongside, same era.
B. A. Bash, D. Goeckel, and D. Towsley, “Square root law for communication with low probability of detection on AWGN channels,” in Proc. IEEE Int. Symp. Inform. Theory (ISIT) , Cambridge, MA, Jul. 2012
2012
Cited alongside, same era.
2013
Cited alongside, same era.
2013
Cited alongside, same era.
B. A. Bash, S. Guha, D. Goeckel, and D. Towsley, “Quantum Noise Limited Communication with Low Probability of Detection,” in Proc. IEEE Int. Symp. Inform. Theory (ISIT) , Istanbul, Turkey, Jul. 2013
2013
Cited alongside, same era.
B. A. Bash, D. Goeckel, and D. Towsley, “LPD Communication when the Warden Does Not Know When,” in Proc. IEEE Int. Symp. Inform. Theory (ISIT) , Honolulu, HI, Jul. 2014
2014
Cited alongside, same era.
BBC, “Edward Snowden: Leaks that exposed US spy programme,” http://www.bbc.com/news/world-us-canada-23123964
2014
Cited alongside, same era.
B. A. Bash, A. H. Gheorghe, M. Patel, J. L. Habif, D. Goeckel, D. Towsley, and S. Guha, “Quantum-secure covert communication on bosonic channels,” Nat Commun , vol. 6, Oct 2015
2015
Closest in time.
S. Lee, R. Baxley, M. Weitnauer, and B. Walkenhorst, “Achieving undetectable communication,” IEEE J. Select. Topics Signal Proc. , vol. 9, no. 7, pp. 1195–1205, Oct. 2015
2015
Closest in time.
T. V. Sobers, B. A. Bash, D. Goeckel, S. Guha, and D. Towsley, “Covert communication with the help of an uninformed jammer achieves positive rate,” in Asilomar Conf. Signals Syst. Comput. , Nov 2015, pp. 625–629
2015
Closest in time.
B. A. Bash, D. Goeckel, S. Guha, and D. Towsley, “Hiding information in noise: Fundamental limits of covert wireless communication,” IEEE Commun. Mag. , vol. 53, no. 12, 2015
2015
Closest in time.
M. R. Bloch, “Covert communication over noisy channels: A resolvability perspective,” IEEE Trans. Inf. Theory , vol. 62, no. 5, pp. 2334–2354, May 2016
2016
Closest in time.
L. Wang, G. W. Wornell, and L. Zheng, “Fundamental limits of communication with low probability of detection,” IEEE Trans. Inf. Theory , vol. 62, no. 6, pp. 3493–3503, June 2016
2016
Closest in time.
2016
Closest in time.
K. S. K. Arumugam and M. R. Bloch, “Keyless asynchronous covert communication,” in Proc. Inform. Theory Workshop (ITW) , Sep. 2016
2016
Closest in time.
D. Goeckel, B. Bash, S. Guha, and D. Towsley, “Covert communications when the warden does not know the background noise power,” IEEE Commun. Lett. , vol. 20, no. 2, pp. 236–239, Feb 2016
2016
Closest in time.