Skip to main content

Abstract

In this paper we propose a method for hiding a secret message in a digital image that is based on parsing the cover image instead of changing its structure. Our algorithm uses a divide-and-conquer strategy and works in Θ(nlogn) time. Its core idea is based on the problem of finding the longest common substring of two strings. The key advantage of our method is that the cover image is not modified, which makes it very difficult for any steganalysis technique based on image analysis to detect and extract the message from the image.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

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. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, pp. 306–318. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Cormen, Leiserson, Rivest, Stein.: Introduction to algorithms, 2nd edn. The MIT press, Cambridge (2001)

    MATH  Google Scholar 

  3. Dunbar, B.: A detailed look at steganographic techniques and their use in an open-systems environment. Sans InfoSec Reading Room (2002)

    Google Scholar 

  4. Fridrich, J., Pevný, T., Kodovský, J.: Statistically undetectable jpeg steganography: dead ends challenges, and opportunities. In: Proceedings of the 9th Workshop on Multimedia & Security, pp. 3–14. ACM, New York (2007)

    Google Scholar 

  5. Gusfield, D.: Algorithms on strings, trees, and sequences. Cambridge university press, Cambridge (1997)

    Book  MATH  Google Scholar 

  6. Huaiqing, W., Wang, S.: Cyber warfare: Steganography vs. steganalysis. Communications of the ACM 47(10), 76–82 (2004)

    Article  Google Scholar 

  7. Fridrich, M.G.J.: Practical steganalysis of digital images - state of the art. Security and Watermarking of Multimedia Contents IV 4675, 1–13 (2002)

    Article  Google Scholar 

  8. Johnson, N., Jajodia, S.: Steganalysis of images created using current steganography software. In: Workshop on Information Hiding (1998)

    Google Scholar 

  9. Johnson, N., Jajodia, S.: Steganalysis: The investigation of hidden information. In: Proc. of the 1998 IEEE Information Technology Conference (1998)

    Google Scholar 

  10. Katzenbeisser, Petitcolas: Information hiding: Techniques for steganography and watermarking. Artech House, Boston (2000)

    Google Scholar 

  11. Ker, A.D.: 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 

  12. Krenn, R.: Steganography and steganalysis. Whitepaper (2004)

    Google Scholar 

  13. Lee, K., Westfeld, A., Lee, S.: Generalised category attack—improving histogram-based attack on JPEG LSB embedding. In: Furon, T., Cayre, F., Doërr, G., Bas, P. (eds.) IH 2007. LNCS, vol. 4567, pp. 378–391. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Lin, E.T., Delp, E.J.: A review of data hiding in digital images. In: Proceedings of the Image Processing, Image Quality, Image Capture Systems Conference (1999)

    Google Scholar 

  15. Shirali-Shahreza, M., Shirali-Shahreza, S.: Collage steganography. In: Proceedings of the 5th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2006), Honolulu, HI, USA, pp. 316–321 (July 2006)

    Google Scholar 

  16. Upham, D.: Steganographic algorithm JSteg, http://zooid.org/paul/crypto/jsteg

  17. 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 

  18. Yu, X., Wang, Y., Tan, T.: On estimation of secret message length in jsteg-like steganography. In: Proceedings of the Pattern Recognition, 17th International Conference on (ICPR 2004), pp. 673–676. IEEE Computer Society, Los Alamitos (2000)

    Google Scholar 

  19. Zahedi Kermani, M.J.Z.: A robust steganography algorithm based on texture similarity using gabor filter. In: IEEE 5th International Symposium on Signal Processing and Information Technology (2005)

    Google Scholar 

  20. Zhang, T., Ping, X.: A fast and effective steganalytic technique against jsteg-like algorithms. In: SAC 2003, pp. 307–311. ACM, New York (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farhat, H., Challita, K., Zalaket, J. (2011). Static Parsing Steganography. In: Cherifi, H., Zain, J.M., El-Qawasmeh, E. (eds) Digital Information and Communication Technology and Its Applications. DICTAP 2011. Communications in Computer and Information Science, vol 166. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21984-9_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21984-9_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21983-2

  • Online ISBN: 978-3-642-21984-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics