Limits of reliable communication with low probability of detection on AWGN channels

IEEE Journal on Selected Areas in Communications

Volumn 31, Issue 9, 2013, Pages 1921-1930

  Bash, Boulat A ^a   Goeckel, Dennis ^b   Towsley, Don ^a  

^a University of Massachusetts Amherst   (United States)

^b University of Massachusetts   (United States)

Author keywords

covert communication; Low probability of detection communication; spread spectrum communication

Indexed keywords

ADDITIVE WHITE GAUSSIAN NOISE CHANNEL; AMOUNT OF INFORMATION; COVERT COMMUNICATIONS; DECODING ERRORS; LOW PROBABILITY OF DETECTIONS; MISSED DETECTIONS; NON-ZERO PROBABILITY; RELIABLE COMMUNICATION;

COMMUNICATION; SPREAD SPECTRUM COMMUNICATION; TRANSMITTERS;

WHITE NOISE;

EID: 84883395039     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2013.130923     Document Type: Article

References (30)

1. M. K. Simon, J. K. Omura, R. A. Scholtz, and B. K. Levitt, Spread Spectrum Communications Handbook. McGraw-Hill, 1994.
2. J. Fridrich, Steganography in Digital Media: Principles, Algorithms, and Applications, 1st ed. New York, NY, USA: Cambridge University Press, 2009.
3. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. Cambridge, Massachusetts: MIT Press, 2001.
4. C. E. Shannon, "Communication theory of security," Bell System Technical J., vol. 28, pp. 656-715, 1949.
5. 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.
6. E. Lehmann and J. Romano, Testing Statistical Hypotheses, 3rd ed. New York: Springer, 2005.
7. T. M. Cover and J. A. Thomas, Elements of Information Theory, 2nd ed. John Wiley & Sons, Hoboken, NJ, 2002.
8. C. Cachin, "An information-theoretic model for steganography," Information and Computation, vol. 192, no. 1, pp. 41-56, 2004.
9. H. L. Van Trees, Detection, Estimation, and Modulation Theory, Part I: Detection, Estimation, and Linear Modulation Theory. NewYork: John Wiley & Sons, Inc., 2001.
10. S. Lang, Undergraduate Analysis, 2nd ed. New York, NY: Springer-Verlag, 1997.
11. S. Kullback, Information Theory and Statistics. New York, NY: Wiley, 1959.
12. U. Madhow, Fundamentals of Digital Communication. Cambridge, UK: Cambridge University Press, 2008.
13. 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.
14. B. A. Bash, D. Goeckel, and D. Towsley, "Limits of reliable communication with low probability of detection on AWGN channels," University of Massachusetts, Tech. Rep. UM-CS-2012-003, 2012.
15. A. Barg and G. D. Forney, Jr., "Random codes: minimum distances and error exponents," IEEE Trans. Inf. Theory, vol. 48, no. 9, pp. 2568-2573, Sep. 2002.
16. E. E. Majani, "A model for the study of very noisy channels, and applications," Ph.D. dissertation, California Institute of Technology, 1988.
17. A. D. Ker, "A capacity result for batch steganography," IEEE Signal Process. Lett., vol. 14, no. 8, pp. 525-528, Aug. 2007.
18. 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.
19. A. D. Ker, "The square root law requires a linear key," in Proc. 11th ACM workshop on Multimedia and security, ser. MM&Sec '09. New York, NY, USA: ACM, 2009, pp. 85-92.
20. "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.
21. T. Filler and J. Fridrich, "Fisher information determines capacity of -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.
22. 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.
23. A. D. Wyner, "The wire-tap channel," Bell System Technical Journal, vol. 54, pp. 1355-1387, 1975.
24. S. Leung-Yan-Cheong and M. Hellman, "The gaussian wire-tap channel," IEEE Trans. Inf. Theory, vol. 24, no. 4, pp. 451-456, Jul. 1978.
25. I. Csiszar and J. Korner, "Broadcast channels with confidential messages," IEEE Trans. Inf. Theory, vol. 24, no. 3, pp. 339-348, May 1978.
26. P. H. Che, M. Bakshi, and S. Jaggi, "Reliable deniable communication: Hiding messages in noise," arXiv:1304.6693, 2013.
27. G. Danezis and C. Diaz, "A survey of anonymous communication channels," Microsoft Research, Tech. Rep. TR-2008-35, 2008.
28. S. Marano, V. Matta, T. He, and L. Tong, "The embedding capacity of information flows under renewal traffic," IEEE Trans. Inf. Theory, vol. 59, no. 3, pp. 1724-1739, 2013.
29. T. Yucek and H. Arslan, "A survey of spectrum sensing algorithms for cognitive radio applications," IEEE Commun. Surveys & Tutorials, vol. 11, no. 1, pp. 116-130, First Qtr 2009.
30. W. Ren, A. Swami, and Q. Zhao, "Coexistence, connectivity and delay in heterogeneous networks," in Proc. 27th Army Science Conference, 2011.