Fetching the paper…
Reading the bibliography…
We present a square root limit on the amount of information transmitted reliably and with low probability of detection (LPD) over additive white Gaussian noise (AWGN) channels.
C. E. Shannon, “Communication theory of security,” Bell System Technical Journal , vol. 28, pp. 656–715, 1949
1949
Earlier work this paper cites.
S. Kullback, Information Theory and Statistics . New York, NY: Wiley, 1959
1959
Earlier work this paper cites.
A. D. Wyner, “The wire-tap channel,” Bell System Technical Journal , vol. 54, pp. 1355–1387, 1975
1975
Earlier work this paper cites.
S. Leung-Yan-Cheong and M. Hellman, “The gaussian wire-tap channel,” IEEE Transactions on Information Theory , vol. 24, no. 4, pp. 451–456, Jul. 1978
1978
Earlier work this paper cites.
I. Csiszár and J. Körner, “Broadcast channels with confidential messages,” IEEE Transactions on Information Theory , vol. 24, no. 3, pp. 339–348, May 1978
1978
Earlier work this paper cites.
L. E. Varakin, Sistemy svyazi s shumopodobnymi signalami (Spread Spectrum Communication Systems) . Moscow, USSR: Radio i Svyaz’, 1985, (in Russian)
1985
Earlier work this paper cites.
E. E. Majani, “A model for the study of very noisy channels, and applications,” Ph.D. dissertation, California Institute of Technology, 1988
1988
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.
A. J. Menezes, S. A. Vanstone, and P. C. V. Oorschot, Handbook of Applied Cryptography , 1st ed. Boca Raton, FL, USA: CRC Press, Inc., 1996
1996
Earlier work this paper cites.
S. Lang, Undergraduate Analysis , 2nd ed. New York, NY: Springer-Verlag, 1997
1997
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
Cited alongside, same era.
H. L. Van Trees, Detection, Estimation, and Modulation Theory, Part I: Detection, Estimation, and Linear Modulation Theory . New York: John Wiley & Sons, Inc., 2001
2001
Cited alongside, same era.
T. M. Cover and J. A. Thomas, Elements of Information Theory , 2nd ed. John Wiley & Sons, Hoboken, NJ, 2002
2002
Cited alongside, same era.
A. Barg and G. D. Forney, Jr., “Random codes: minimum distances and error exponents,” IEEE Transactions on Information Theory , vol. 48, no. 9, pp. 2568–2573, Sep. 2002
2002
Cited alongside, same era.
M. Chiani, D. Dardari, and M. K. Simon, “New exponential bounds and approximations for the computation of error probability in fading channels,” IEEE Transactions on Wireless Communications , vol. 2, no. 4, pp. 840–845, Jul. 2003
J. Fridrich, Steganography in Digital Media: Principles, Algorithms, and Applications , 1st ed. New York, NY, USA: Cambridge University Press, 2009
2009
Later among the works it cites.
T. Filler, A. D. Ker, and J. Fridrich, “The square root law of steganographic capacity for markov covers,” Media Forensics and Security , vol. 7254, no. 1, 2009
2009
Later among the works it cites.
A. D. Ker, “The square root law requires a linear key,” in Proceedings of the 11th ACM workshop on Multimedia and security , ser. MM&Sec ’09. New York, NY, USA: ACM, 2009, pp. 85–92
2009
Later among the works it cites.
T. Filler and J. Fridrich, “Fisher information determines capacity of ϵ \epsilon -secure steganography,” in Information Hiding , ser. Lecture Notes in Computer Science, S. Katzenbeisser and A.-R. Sadeghi, Eds. Springer Berlin / Heidelberg, 2009, vol. 5806, pp. 31–47
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2003
Cited alongside, same era.
C. Cachin, “An information-theoretic model for steganography,” Information and Computation , vol. 192, no. 1, pp. 41–56, 2004
2004
Cited alongside, same era.
E. Lehmann and J. Romano, Testing Statistical Hypotheses , 3rd ed. New York: Springer, 2005
2005
Cited alongside, same era.
A. D. Ker, “A capacity result for batch steganography,” IEEE Signal Processing Letters , 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.
G. Danezis and C. Diaz, “A survey of anonymous communication channels,” Microsoft Research, Tech. Rep. TR-2008-35, 2008
2008
Cited alongside, same era.
A. D. Ker, “Estimating steganographic fisher information in real images,” in Information Hiding , ser. Lecture Notes in Computer Science, S. Katzenbeisser and A.-R. Sadeghi, Eds. Springer Berlin / Heidelberg, 2009, vol. 5806, pp. 73–88
2009
Later among the works it cites.
T. Yucek and H. Arslan, “A survey of spectrum sensing algorithms for cognitive radio applications,” IEEE Communications Surveys & Tutorials , vol. 11, no. 1, pp. 116–130, First Qtr 2009
2009
Later among the works it cites.
——, “The square root law does not require a linear key,” in Proceedings of the 12th ACM workshop on Multimedia and security , ser. MM&Sec ’10. New York, NY, USA: ACM, 2010, pp. 213–224
2010
Later among the works it cites.
W. Ren, A. Swami, and Q. Zhao, “Coexistence, connectivity and delay in heterogeneous networks,” in Proceedings of the 27th Army Science Conference , 2011
2011
Later among the works it cites.
S. Marano, V. Matta, T. He, and L. Tong, “The embedding capacity of information flows under renewal traffic,” IEEE Transactions on Information Theory , 2012, to be published
2012
Closest in time.
P. H. Che, M. Bakshi, S. Jaggi, and M. J. Siavoshani, “Reliable deniable communication: Hiding messages in noise,” Private communication, 2013
2013
Closest in time.