Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2361407.2361409acmconferencesArticle/Chapter ViewAbstractPublication Pagesih-n-mmsecConference Proceedingsconference-collections
research-article

Batch steganography in the real world

Published:06 September 2012Publication History

ABSTRACT

We examine the universal pooled steganalyzer of in two respects. First, we confirm that the method is applicable to a number of different steganographic embedding methods. Second, we consider the converse problem of how to spread payload between multiple covers, by testing different payload allocation strategies against the universal steganalyzer. We focus on practical options which can be implemented without new software or expert knowledge, and we test on real-world data. Concentration of payload into the minimal number of covers is consistently the least detectable option. We present additional investigations which explain this phenomenon, uncovering a nonlinear relationship between embedding distortion and payload. We conjecture that this is an unavoidable consequence of blind steganalysis. This is significant for both batch steganography and pooled steganalysis.

References

  1. M. M. Breunig, H.-P. Kriegel, R. T. Ng, and J. Sander. Lof: Identifying density-based local outliers. In Proc. 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD, pages 93--104. ACM, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. T. Filler and J. Fridrich. Gibbs construction in steganography. IEEE Transactions on Information Forensics and Security, 5(4):705--720, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. T. Filler and J. Fridrich. Minimizing additive distortion functions with non-binary embedding operation in steganography. In Information Forensics and Security (WIFS), 2010 IEEE International Workshop on, pages 1--6, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  4. T. Filler and J. Fridrich. Design of adaptive steganographic schemes for digital images. In N. D. Memon, J. Dittmann, A. M. Alattar, and E. J. Delp III, editors, Media Watermarking, Security, and Forensics XIV, volume 7880 of Proc. SPIE, page 78800F. SPIE, 2011.Google ScholarGoogle Scholar
  5. T. Filler, J. Judas, and J. Fridrich. Minimizing additive distortion in steganography using syndrome-trellis codes. IEEE Transactions on Information Forensics and Security, 6(3):920--935, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Fridrich, M. Goljan, and D. Soukal. Wet paper codes with improved embedding efficiency. IEEE Transactions on Information Forensics and Security, 1(1):102--110, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Fridrich, T. Pevný, and J. Kodovský. Statistically undetectable JPEG steganography: Dead ends challenges, and opportunities. In Proc. 9th ACM Workshop on Multimedia and Security, MM&Sec, pages 3--14. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Gretton, K. M. Borgwardt, M. J. Rasch, B. Schölkopf, and A. J. Smola. A kernel method for the two-sample problem. pages 513--520, 2007.Google ScholarGoogle Scholar
  9. S. Hetzl. Implementation of the Steghide algorithm ver. 0.5.1 (released October 2003). http://steghide.sourceforge.net/, last accessed April 2012.Google ScholarGoogle Scholar
  10. S. Hetzl and P. Mutzel. A graph-theoretic approach to steganography. In Proc. 9th International Conference on Communications and Multimedia Security, CMS, pages 119--128. Springer, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. A. D. Ker. Batch steganography and pooled steganalysis. In J. Camenisch, C. Collberg, N. Johnson, and P. Sallee, editors, Proc. 8th Information Hiding Workshop, volume 4437 of LNCS, pages 265--281. Springer, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. A. D. Ker. Batch steganography and the threshold game. In E. Delp III and P. Wong, editors, Security, Steganography, and Watermarking of Multimedia Contents IX, volume 6505 of Proc. SPIE, pages 0401--0413. SPIE, 2007.Google ScholarGoogle Scholar
  13. A. D. Ker. Perturbation hiding and the batch steganography problem. In K. Solanki, K. Sullivan, and U. Madhow, editors, Proc. 10th Information Hiding Workshop, volume 5284 of LNCS, pages 45--59. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. A. D. Ker and T. Pevný. A new paradigm for steganalysis via clustering. In N. Memon, J. Dittmann, A. Alattar, and E. Delp III, editors, Media Watermarking, Security, and Forensics XIII, volume 7880 of Proc. SPIE, pages 0U01--0U13. SPIE, 2011.Google ScholarGoogle Scholar
  15. A. D. Ker and T. Pevný. Identifying a steganographer in realistic and heterogeneous data sets. In N. Memon, A. Alattar, and E. Delp III, editors, Media Watermarking, Security, and Forensics XIV, volume 8303 of Proc. SPIE, pages 0N01--0N13. SPIE, 2012.Google ScholarGoogle Scholar
  16. J. Kodovský. simulator of the nsF5 algorithm with wet paper codes (released 2008). http://dde.binghamton.edu/download/nsf5simulator/, last accessed April 2012.Google ScholarGoogle Scholar
  17. A. Latham. Implementation of the JPHide and JPSeek algorithms ver 0.3 (released August 1999). http://linux01.gwdg.de/ alatham/stego.html, last accessed April 2012.Google ScholarGoogle Scholar
  18. T. Pevný, T. Filler, and P. Bas. Using high-dimensional image models to perform highly undetectable steganography. In P. W. L. Fong, R. Böhme, and R. Safavi-Naini, editors, Proc. 12th Information Hiding Workshop, volume 6387 of LNCS, pages 161--177. Springer, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. T. Pevný and J. Fridrich. Merging Markov and DCT features for multi-class JPEG steganalysis. In E. J. Delp III and P. W. Wong, editors, Media Watermarking, Security, and Forensics IX, volume 6505, pages 03--14. SPIE, 2007.Google ScholarGoogle Scholar
  20. T. Pevný, J. Fridrich, and A. D. Ker. From blind to quantitative steganalysis. Information Forensics and Security, IEEE Transactions on, 7(2):445--454, 2012.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. N. Provos. Defending against statistical steganalysis. In Proc. 10th Conference on USENIX Security Symposium - Volume 10, SSYM, pages 323--335. USENIX Association, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. N. Provos. Implementation of the OutGuess algorithm ver. 2.0 (released October 2001). http://www.outguess.org/, last accessed April 2012.Google ScholarGoogle Scholar
  23. D. Upham. Implementation of the JSteg steganographic algorithm. http://zooid.org/ paul/crypto/jsteg/, last accessed on April 2012.Google ScholarGoogle Scholar
  24. A. Westfeld. F5-a steganographic algorithm. In I. Moskowitz, editor, Proc. 4th Information Hiding Workshop, volume 2137 of LNCS, pages 289--302. Springer, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. A. Westfeld. Implementation of the F5 steganographic algorithm (released May 2011). http://code.google.com/p/f5-steganography/, last accessed April 2012.Google ScholarGoogle Scholar

Index Terms

  1. Batch steganography in the real world

    Recommendations

    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 '12: Proceedings of the on Multimedia and security
      September 2012
      184 pages
      ISBN:9781450314176
      DOI:10.1145/2361407

      Copyright © 2012 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: 6 September 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate128of318submissions,40%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader