Where to hide the bits?

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7638 LNCS, Issue , 2012, Pages 1-17

  Johnson, Benjamin ^a   Schöttle, Pascal ^b   Böhme, Rainer ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF MÜNSTER   (Germany)

Author keywords

Game Theory; Information Hiding; Security; Steganography

Indexed keywords

HIDDEN MESSAGES; INFORMATION HIDING; MIXED STRATEGY; NASH EQUILIBRIA; SECURITY; SIDE INFORMATION; ZERO-SUM GAME;

STEGANOGRAPHY;

GAME THEORY;

EID: 84869417796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-34266-0_1     Document Type: Conference Paper

References (12)

1. Böhme, R.: Advanced Statistical Steganalysis. Springer (2010)
2. Cachin, C.: An Information-Theoretic Model for Steganography. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 306-318. Springer, Heidelberg (1998)
3. Dalvi, N., Domingos, P., Mausam, Sanghai, S., Verma, D.: Adversarial classification. In: Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 99-108. ACM, New York (2004)
4. Filler, T., Judas, J., Fridrich, J.J.: Minimizing Embedding Impact in Steganography Using Trellis-coded Quantization. In: Memon, N.D., Dittmann, J., Alattar, A.M., Delp, E.J. (eds.) Media Forensics and Security. SPIE Proceedings, vol. 7541, p. 754105. SPIE (2010)
5. Fridrich, J.: Minimizing the Embedding Impact in Steganography. In: Workshop on Multimedia and Security, pp. 2-10. ACM (2006)
6. Hopper, N.J., Langford, J., von Ahn, L.: Provably Secure Steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 77-92. Springer, Heidelberg (2002)
7. Katzenbeisser, S., Petitcolas, F.A.P.: Defining Security in Steganographic Systems. In: Delp, E.J., Wong, P.W. (eds.) Security, Steganography and Watermarking of Multimedia Contents IV, San Jose, CA, vol. 4675, pp. 50-56 (2002)
8. Ker, A.D.: The Square Root Law in Stegosystems with Imperfect Information. In: Böhme, R., Fong, P.W.L., Safavi-Naini, R. (eds.) IH 2010. LNCS, vol. 6387, pp. 145-160. Springer, Heidelberg (2010)
9. Ker, A.D., Pevńy, T., Kodovský, J., Fridrich, J.: The Square Root Law of Steganographic Capacity. In: MM&Sec 2008: Proceedings of the 10th ACM Workshop on Multimedia and Security, pp. 107-116. ACM, New York (2008)
10. Pevný, T., Filler, T., Bas, P.: Using High-Dimensional Image Models to Perform Highly Undetectable Steganography. In: Böhme, R., Fong, P.W.L., Safavi-Naini, R. (eds.) IH 2010. LNCS, vol. 6387, pp. 161-177. Springer, Heidelberg (2010)
11. Schöttle, P., Böhme, R.: A Game-Theoretic Approach to Content-Adaptive Steganography. In: Ghosal, D., Kirchner, M. (eds.) Information Hiding. LNCS, Springer (to appear, 2012)
12. Wang, Y., Moulin, P.: Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions. IEEE Transactions on Information Theory 54(6), 2706-2722 (2008)