skip to main content
10.1145/1022431.1022444acmconferencesArticle/Chapter ViewAbstractPublication Pagesih-n-mmsecConference Proceedingsconference-collections
Article

Hidden Markov models and steganalysis

Published:20 September 2004Publication History

ABSTRACT

In this paper we presented a novel approach to steganalysis. We formulated two problems for steganalysis and showed that these problems can be solved using the theory of hidden markov models, the case of LSB encoding is discussed in detail. Some suggestions about steganalysis of images using hidden markov field model conclude the paper.

References

  1. J. Anigbogu and A. Belaid. Hidden markov models in text recognition. IJPRAI, 9(6):925--958, 1995.]]Google ScholarGoogle ScholarCross RefCross Ref
  2. C. Cachin. An information-theoretic model for steganography. Lecture Notes in Computer Science, 1525:306--318, 1998.]]Google ScholarGoogle ScholarCross RefCross Ref
  3. G. Celeux, F. Forbes, and N. Peyrard. EM procedures using mean field-like approximations for markov model-based image segmentation. Pattern Recognition, 36(1):131--144, 2003.]]Google ScholarGoogle Scholar
  4. B. Chalmond. An iterative gibbsian technique for reconstruction of m-ary images. Pattern Recognition, 22(6):747--761, 1989.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Dumitrescu, X. Wu, and Z. Wang. Detection of LSB steganography via sample pair analysis. In IEEE Transactions on Signal Processing, pages 1995--2007, July 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Fridrich and R. D. M. Goljan. Reliable detection of LSB steganography in grayscale and color images. In Proc. of the ACM Workshop on Multimedia and Security, pages 27--30, October 2001.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. N. F. Johnson, Z. Duric, and S. Jajodia. Information hiding: steganography and watermarking - attacks and countermeasures. Kluwer, USA, 2000.]]Google ScholarGoogle Scholar
  8. P. Moulin and J. O'Sullivan. Information-theoretic analysis of information hiding. Preprint submitted to IEEE Trans. on Information Theory, October 1999.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. L. R. Rabiner. A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257--286, February 1989.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Sidorov. A statistical steganalysis for digital images. In Proc. of the International I & S Workshop, pages 34--36, January 2004.]]Google ScholarGoogle Scholar
  11. K. Sullivan, O. Dabeer, U. Madhow, B. Manjunath, and S. Chandrasekaran. LLRT based detection of LSB hiding. In IEEE International Conference on Image Processing (ICIP), September 2003.]]Google ScholarGoogle ScholarCross RefCross Ref
  12. G. Winkler. Image Analysis, Random Fields and Dynamic Monte Carlo Methods. Springer Verlag, 1995.]]Google ScholarGoogle Scholar
  13. J. Zhang. The mean field theory in EM procedures for markov random fields. IEEE Transactions on Signal Processing, 40(10):2570--2583, 1992.]]Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Hidden Markov models and steganalysis

      Recommendations

      Reviews

      Kevin Denis Reilly

      Due to fears of secret messages being passed by terrorists, steganalysis has become topical. Hiding messages within a container or cover presents several problems, including the difficulty of detecting embedded information (existence and size of specific messages, or features within); the issue of restoring damaged containers; and the possibility of evading detection. Not all of these problems differ significantly from standard image analysis issues, and this emerges as a key to this paper's intent?to find and fill a gap in the literature. A general description of the problem is characterized as a function on sets x, m, and k: containers, messages, and secret keys (known to sender and receiver). Partial information on these is assumed to be available to would-be detectors, represented, for example, for m and m as a random value θ(m, k). The author focuses on θ when the stego-message y = f(x,m,k) is given, and x when y is given and θ is known or evaluated. Identifying similarities to well-known hidden Markov model (HMM) solutions leads to standard solution methods that are then applied to an example of least significant bit (LSB) manipulation. Sidorov's simulation results provoke switching to random Markov field models to cover deficiencies. Container and encoding issues affecting appropriateness are not covered, but are implicit in the cited results. A claimed novelty lies in promoting established image analysis methods, particularly when containers are images; this point serves the author's appeal for more HMM research in steganalysis. A claimed uniformity rests on "hiddenness" in the principal methods discussed, despite differences in solution attacks. (Markov chains are well represented in the field.) Online Computing Reviews Service

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        MM&Sec '04: Proceedings of the 2004 workshop on Multimedia and security
        September 2004
        236 pages
        ISBN:1581138547
        DOI:10.1145/1022431

        Copyright © 2004 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 20 September 2004

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate128of318submissions,40%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader