Skip to main content

On the Achievable Rate of Side Informed Embedding Techniques with Steganographic Constraints

  • Conference paper
Digital Watermarking (IWDW 2005)

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

Included in the following conference series:

Abstract

The development of watermarking schemes in the literature is generally guided by a power constraint on the watermark to be embedded into the host. In a steganographic framework there is an additional constraint on the embedding procedure. It states that, for a scheme to be undetectable by statistical means, the pdf of the host signal must be approximately or exactly equal to that of the stegotext. In this work we examine this additional constraint when coupled with DC-DM. An analysis of the embedding scheme Stochastic QIM, which automatically meets the condition under certain assumptions, is presented and finally the capacity of the steganographic channel is examined.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Simmons, G.: The prisoner’s problem and the subliminal channel. In: Advances in Cryptology, Crypto 1983, vol. 20, pp. 51–67. Plenum Press (1984)

    Google Scholar 

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

  3. Costa, M.: Writing on dirty paper. IEEE Trans. on Information Theory 29, 439–441 (1983)

    Article  MATH  Google Scholar 

  4. Moulin, P., Wang, Y.: New results on steganographic capacity. In: Proc. CISS Conference, Princeton, USA (2004)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Eggers, J., Girod, B.: Informed watermarking. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  7. Hogan, M.T., Hurley, N.J., Silvestre, G.C., Balado, F., Whelan, K.M.: ML detection of steganography. In: Security, Steganography and Watermarking of Multimedia Contents. Proc. Electronic Imaging, vol. 5681. SPIE (2005)

    Google Scholar 

  8. Wang, Y., Moulin, P.: Steganalysis of block structured stegotext. In: Security, Steganography and Watermarking of Multimedia Contents. Proc. Electronic Imaging, vol. 5306. SPIE (2004)

    Google Scholar 

  9. Guillon, P., Furon, T., Duhamel, P.: Applied public-key steganography. In: Security and Watermarking of Multimedia Contents. Proc. Electronic Imaging, vol. 4675, pp. 38–49. SPIE (2002)

    Google Scholar 

  10. Cover, T., Thomas, J.: Elements of Information Theory. J. Wiley & Sons, Chichester (1991)

    Book  MATH  Google Scholar 

  11. Van Trees, H.L.: Detection, Estimation and Modulation Theory. J. Wiley & Sons, Chichester (1968)

    MATH  Google Scholar 

  12. Johnson, D.H., Orsak, G.C.: Relation of signal set choice to the performance of optimal non-Gaussian detectors. IEEE Trans. on Communications 41 (1993)

    Google Scholar 

  13. Barron, R.J., Chen, B., Wornell, G.W.: The duality between information embedding and source coding with side information and some applications. IEEE Trans. on Information Theory 49, 1159–1180 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Pérez-Freire, L., Pérez-González, F., Voloshinovskiy, S.: Revisiting scalar quantization-based data hiding: Exact analysis and results. IEEE Trans. on Signal Processing (2005) (to appear)

    Google Scholar 

  15. Hamkins, J., Zeger, K.: Gaussian source coding with spherical codes. IEEE Trans. on Information Theory 48, 2980–2988 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hogan, M.T., Balado, F., Hurley, N.J., Silvestre, G.C.M. (2005). On the Achievable Rate of Side Informed Embedding Techniques with Steganographic Constraints. In: Barni, M., Cox, I., Kalker, T., Kim, HJ. (eds) Digital Watermarking. IWDW 2005. Lecture Notes in Computer Science, vol 3710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11551492_30

Download citation

  • DOI: https://doi.org/10.1007/11551492_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28768-1

  • Online ISBN: 978-3-540-32052-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics