The square root law does not require a linear key

MM and Sec'10 - Proceedings of the 2010 ACM SIGMM Multimedia and Security Workshop

Volumn , Issue , 2010, Pages 213-223

  Ker, Andrew D ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

square root law; steganalysis; steganographic capacity; steganography

Indexed keywords

EMBEDDING KEY; EMBEDDING PROCESS; FISHER INFORMATION; HIDDEN PAYLOAD; MATRIX; PAY LOAD CAPACITY; SQUARE ROOTS; STATISTICAL PROPERTIES; STEGANALYSIS; STEGANOGRAPHIC CAPACITY; STEGANOGRAPHIC SECURITY;

ASYMPTOTIC ANALYSIS; FISHER INFORMATION MATRIX; STEGANOGRAPHY; TECHNICAL PRESENTATIONS;

LOCATION;

EID: 78149262243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1854229.1854267     Document Type: Conference Paper

References (18)

1. R. Anderson and F. Petitcolas. On the limits of steganography. IEEE J. Selected Areas in Communications, Special Issue on Copyright and Privacy Protection, 16(4):474-481, 1998.
2. R. Böhme. Wet paper codes for public key steganography? Unpublished rump session talk at 7th Information Hiding Workshop, Barcelona, Spain, 2005. Available at http://www.inf.tu-dresden.de/~rb21/publications/Boehme2005-IHW- RumpSession.pdf.
3. W. Feller. An Introduction to Probability Theory and Its Applications, Volume II. Wiley, 1966.
4. T. Filler and J. Fridrich. Fisher Information determines capacity of ε-secure steganography. In Proc. 11th Information Hiding Workshop, volume 5806 of Springer LNCS, pages 31-47, 2009.
5. T. Filler, A. Ker, and J. Fridrich. The square root law of steganographic capacity for Markov covers. In Media Forensics and Security XI, volume 7254 of Proc. SPIE, pages 0801-0811, 2009.
6. J. Fridrich. Asymptotic behavior of the ZZW embedding construction. IEEE Trans. Information Forensics and Security, 4(1):151-153, 2009.
7. J. Fridrich, M. Goljan, P. Lisoněk, and D. Soukal. Writing on wet paper. IEEE Trans. Sig. Proc., Special Issue on Media Security, 53:3923-3935, 2005.
8. J. Fridrich, P. Lisoněk, and D. Soukal. On steganographic embedding efficiency. In Proc. 10th Information Hiding Workshop, volume 4437 of Springer LNCS, pages 60-71, 2008.
9. R. Graham, D. Knuth, and O. Patashnik. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, 1994.
10. A. Ker. A capacity result for batch steganography. IEEE Signal Processing Letters, 14(8):525-528, 2007.
11. A. Ker. The ultimate steganalysis benchmark? In Proc. 9th ACM Workshop on Multimedia and Security, pages 141-148, 2007.
12. A. Ker. Steganographic strategies for a square distortion function. In Security, Forensics, Steganography and Watermarking of Multimedia Contents X, volume 6819 of Proc. SPIE, pages 0401-0413, 2008.
13. A. Ker. Estimating Steganographic Fisher Information in real images. In Proc. 11th Information Hiding Workshop, volume 5806 of Springer LNCS, pages 73-88, 2009.
14. A. Ker. The Square Root Law requires a linear key. In Proc. 11th ACM Workshop on Multimedia and Security, pages 85-92, 2009.
15. A. Ker, T. Pevný, J. Kodovský, and J. Fridrich. The square root law of steganographic capacity. In Proc. 10th ACM Workshop on Multimedia and Security, pages 107-116, 2008.
16. B. Ryabko and D. Ryabko. Asymptotically optimal perfect steganographic systems. Problems of Information Transmission, 45(2):184-190, 2009.
17. A. Westfeld. F5 - a steganographic algorithm: High capacity despite better steganalysis. In Proc. 4th Information Hiding Workshop, volume 2137 of Springer LNCS, pages 289-302, 2001.
18. W. Zhang, Z. Zhang, and S. Wang. Maximizing steganographic embedding efficiency by combining Hamming codes and wet paper codes. In Proc. 10th Information Hiding Workshop, volume 4437 of Springer LNCS, pages 282-296, 2008.