Skip to main content

Obtaining Higher Rates for Steganographic Schemes While Maintaining the Same Detectability

  • Conference paper
Information Hiding (IH 2010)

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

Included in the following conference series:

  • 1819 Accesses

Abstract

This paper focuses on modifying the decoder module for an active steganographic scheme to increase the effective data-rate without affecting the embedding module. Three techniques are suggested to improve the error correction framework of an active steganographic scheme. The first involves puncturing where the code-length is increased by adding a suitable number of additional erasures. The second technique involves channel modeling and soft-decision decoding which is adaptive to the embeddable image coefficient. The third method adjusts the erasure threshold depending on the design hiding quantizer so as to achieve a higher data-rate. Combining these techniques, the effective data-rate is increased by 10%-50% for Yet Another Steganographic Scheme (YASS), a popular active steganographic scheme.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Abbasfar, A.: Turbo-like Codes Design for High Speed Decoding. Springer, Heidelberg (2007)

    Book  MATH  Google Scholar 

  2. Abbasfar, A., Divsalar, D., Yao, K., Inc, R., Los Altos, C.: Accumulate-repeat-accumulate codes. IEEE Transactions on Communications 55(4), 692–702 (2007)

    Article  Google Scholar 

  3. Backes, M., Cachin, C.: Public-key steganography with active attacks. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 210–226. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Bahl, L., Cocke, J., Jelinek, F., Raviv, J.: Optimal decoding of linear codes for minimizing symbol error rate. IEEE Trans. Inform. Theory 20(2), 284–287 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chen, B., Wornell, G.W.: Quantization Index Modulation: A class of provably good methods for digital watermarking and information embedding. IEEE Trans. on Info. Theory 47(4), 1423–1443 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Divsalar, D., Jin, H., McEliece, R.J.: Coding theorems for turbo-like codes. In: 36th Allerton Conf. on Communications, Control, and Computing, pp. 201–210 (September 1998)

    Google Scholar 

  7. Kharrazi, M., Sencar, H., Memon, N.: Image steganography: Concepts and practice. Lecture Note Series, Institute for Mathematical Sciences, National University of Singapore (2004)

    Google Scholar 

  8. Kodovskỳ, J., Pevnỳ, T., Fridrich, J.: Modern steganalysis can detect YASS. In: Proceedings of SPIE, vol. 7541, p. 754102 (2010)

    Google Scholar 

  9. Kodovský, J., Fridrich, J.: Calibration revisited. In: MM & Sec 2009: Proceedings of the 11th ACM Workshop on Multimedia and Security, pp. 63–74. ACM, New York (2009)

    Google Scholar 

  10. Li, B., Shi, Y., Huang, J.: Steganalysis of YASS. In: Proceedings of the 10th ACM Workshop on Multimedia and Security, pp. 139–148. ACM, New York (2008)

    Chapter  Google Scholar 

  11. Muller, F.: Distribution shape of two-dimensional DCT coefficients of natural images. Electronics Letters 29(22), 1935–1936 (1993)

    Article  Google Scholar 

  12. Petitcolas, F.A.P., Anderson, R.J., Kuhn, M.G.: Information hiding — A survey. Proceedings of the IEEE, Special Issue on Identification and Protection of Multimedia Information 87(7), 1062–1078 (1999), http://citeseer.nj.nec.com/petitcolas99information.html

    Google Scholar 

  13. Pevný, T., Fridrich, J.: Merging Markov and DCT features for multi-class JPEG steganalysis. In: Proc. of SPIE, San Jose, CA, p. 3-1–3-14 (2007)

    Google Scholar 

  14. Reininger, R., Gibson, J.: Distributions of the two-dimensional DCT coefficients for images. IEEE Trans. on Comm. 31(6), 835–839 (1983)

    Article  Google Scholar 

  15. Sarkar, A., Manjunath, B.S.: Image dependent log-likelihood ratio allocation for repeat accumulate code based decoding in data hiding channels. In: Proceedings of SPIE, 2010, Media Forensics and Security, vol. 7541, pp. 754113–754113–6 (January 2010), http://vision.ece.ucsb.edu/publications/LLR_SPIE_2010_anindya.pdf

  16. Shi, Y.Q., Chen, C., Chen, W.: A Markov process based approach to effective attacking JPEG steganography. In: Camenisch, J.L., Collberg, C.S., Johnson, N.F., Sallee, P. (eds.) IH 2006. LNCS, vol. 4437, pp. 249–264. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  17. Solanki, K., Sarkar, A., Manjunath, B.S.: YASS: Yet Another Steganographic Scheme that resists blind steganalysis. In: Furon, T., Cayre, F., Doërr, G., Bas, P. (eds.) IH 2007. LNCS, vol. 4567, pp. 16–31. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sarkar, A., Solanki, K., Manjunath, B.S. (2010). Obtaining Higher Rates for Steganographic Schemes While Maintaining the Same Detectability. In: Böhme, R., Fong, P.W.L., Safavi-Naini, R. (eds) Information Hiding. IH 2010. Lecture Notes in Computer Science, vol 6387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16435-4_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16435-4_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16434-7

  • Online ISBN: 978-3-642-16435-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics