Skip to main content

Estimating Steganographic Fisher Information in Real Images

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5806))

Abstract

This paper is concerned with the estimation of steganographic capacity in digital images, using information theoretic bounds and very large-scale experiments to approximate the distributions of genuine covers. The complete distribution cannot be estimated, but with carefully-chosen algorithms and a large corpus we can make local approximations by considering groups of pixels. A simple estimator for the local quadratic term of Kullback-Leibler divergence (Steganographic Fisher Information) is presented, validated on some synthetic images, and computed for a corpus of covers. The results are interesting not so much for their concrete capacity estimates but for the comparisons they provide between different embedding operations, between the information found in differently-sized and -shaped pixel groups, and the results of DC normalization within pixel groups. This work suggests lessons for the future design of spatial-domain steganalysis, and also the optimization of embedding functions.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cachin, C.: An information-theoretic model for steganography. Information and Computation 192(1), 41–56 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Wang, Y., Moulin, P.: Perfectly secure steganography: Capacity, error exponents, and code constructions. IEEE Transactions on Information Theory 54(6), 2706–2722 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Ker, A.: A capacity result for batch steganography. IEEE Signal Processing Letters 14(8), 525–528 (2007)

    Article  Google Scholar 

  4. Filler, T., Ker, A., Fridrich, J.: The square root law of steganographic capacity for Markov covers. In: Proc. SPIE, Media Forensics and Security XI, vol. 7254, pp. 0801–0811 (2009)

    Google Scholar 

  5. Pronzato, L., Leonenko, N., Savani, V.: A class of Renyi information estimators for multidimensional densities. Annals of Statistics 36(5), 2153–2182 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  6. Ker, A.: The ultimate steganalysis benchmark? In: Proc. 9th ACM Workshop on Multimedia and Security, pp. 141–148 (2007)

    Google Scholar 

  7. Kullback, S.: Information Theory and Statistics. Dover, New York (1968)

    MATH  Google Scholar 

  8. Fridrich, J., Soukal, D.: Matrix embedding for large payloads. IEEE Transactions on Information Forensics and Security 1(3), 390–394 (2006)

    Article  Google Scholar 

  9. Ker, A., Pevný, T., Kodovský, J., Fridrich, J.: The square root law of steganographic capacity. In: Proc. 10th ACM Workshop on Multimedia and Security, pp. 107–116 (2008)

    Google Scholar 

  10. Westfeld, A., Pfitzmann, A.: Attacks on steganographic systems. In: Pfitzmann, A. (ed.) IH 1999. LNCS, vol. 1768, pp. 61–76. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  11. Dumitrescu, S., Wu, X., Wang, Z.: Detection of LSB steganography via sample pair analysis. IEEE Transactions on Signal Processing 51(7), 1995–2007 (2003)

    Article  MATH  Google Scholar 

  12. Ker, A.: A fusion of maximum likelihood and structural steganalysis. In: Furon, T., Cayre, F., Doërr, G., Bas, P. (eds.) IH 2007. LNCS, vol. 4567, pp. 204–219. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Ker, A.: A general framework for the structural steganalysis of LSB replacement. In: Barni, M., Herrera-Joancomartí, J., Katzenbeisser, S., Pérez-González, F. (eds.) IH 2005. LNCS, vol. 3727, pp. 296–311. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Fridrich, J., Goljan, M.: On estimation of secret message length in LSB steganography in spatial domain. In: Proc. SPIE, Security, Steganography, and Watermarking of Multimedia Contents VI, vol. 5306, pp. 23–34 (2004)

    Google Scholar 

  15. Ker, A., Böhme, R.: Revisiting WS steganalysis. In: Proc. SPIE, Security, Forensics, Steganography and Watermarking of Multimedia Contents X, vol. 6819, pp. 0501–0517 (2008)

    Google Scholar 

  16. Harmsen, J., Pearlman, W.: Higher-order statistical steganalysis of palette images. In: Proc. SPIE, Security and Watermarking of Multimedia Contents V, vol. 5020, pp. 131–142 (2003)

    Google Scholar 

  17. Ker, A.: Steganalysis of LSB matching in grayscale images. IEEE Signal Processing Letters 12(6), 441–444 (2005)

    Article  Google Scholar 

  18. Ker, A.: Estimating the Information Theoretic Optimal Stego Noise. In: Proc. 8th International Workshop on Digital Watermarking (to appear, 2009)

    Google Scholar 

  19. Ker, A.: Steganalysis of embedding in two least significant bits. IEEE Transactions on Information Forensics and Security 2(1), 46–54 (2007)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ker, A.D. (2009). Estimating Steganographic Fisher Information in Real Images. In: Katzenbeisser, S., Sadeghi, AR. (eds) Information Hiding. IH 2009. Lecture Notes in Computer Science, vol 5806. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04431-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04431-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04430-4

  • Online ISBN: 978-3-642-04431-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics