Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Digital Watermarking

IWDW 2002: Digital Watermarking pp 1–12Cite as

Information-Hiding Games

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2613))

Abstract

This paper reviews recent research on information-theoretic aspects of information hiding. Emphasis is placed on applications requiring high payload (e.g., covert communications). Information hiding may be viewed as a game between two teams (embedder/decoder vs. attacker), and optimal information-embedding and attack strategies may be developed in this context. This paper focuses on several such strategies, including a framework for developing near-optimal codes and universal decoders. The suboptimality of spread-spectrum strategies follows from the analysis. The theory is applied to image watermarking examples.

Work supported by NSF grants CDA 96-24396, MIP-97-07633 and CCR 00-81268.

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

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
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Lapidoth and P. Narayan, “Reliable Communication Under Channel Uncertainty,” IEEE Trans. Info. Thy, Vol. 44, No. 6, pp. 2148–2177, Oct. 1998.

    Article  MATH  MathSciNet  Google Scholar 

  2. I. J. Cox, J. Killian, F. T. Leighton and T. Shamoon, “Secure Spread Spectrum Watermarking for Multimedia,” IEEE Trans. Image Proc., Vol. 6, No. 12, pp. 1673–1687, Dec. 1997.

    Google Scholar 

  3. B. Chen and G. W. Wornell, “Quantization Index Modulation Methods: A Class of Provably Good Methods for Digital Watermarking and Information Embedding,” IEEE Trans. Info. Thy, Vol. 47, No. 4, pp. 1423–1443, May 2001.

    Article  MATH  MathSciNet  Google Scholar 

  4. I. J. Cox, M. L. Miller and A. L. McKellips, “Watermarking as Communications with Side Information,” Proceedings IEEE, Special Issue on Identification and Protection of Multimedia Information, Vol. 87, No. 7, pp. 1127–1141, July 1999.

    Google Scholar 

  5. P. Moulin and J. A. O’sullivan, “Information-Theoretic Analysis of Information Hiding,” Oct. 1999; revised, Sep. 2002. To appear in IEEE Trans. on Information Theory, 2003. Available from http://www.ifp.uiuc.edu/~moulin.

  6. T. M. Cover and J. A. Thomas, Elements of Information Theory, Wiley, 1991.

    Google Scholar 

  7. S. I. Gel'fand and M. S. Pinsker, “Coding for Channel with Random Parameters,” Problems of Control and Information Theory, Vol. 9, No. 1, pp. 19–31, 1980.

    MATH  MathSciNet  Google Scholar 

  8. M. Costa, “Writing on Dirty Paper,” IEEE Trans. Info. Thy, Vol. 29, No. 3, pp. 439–441, May 1983.

    Article  MATH  Google Scholar 

  9. J. Chou, S. Pradhan, L. El Ghaoui and K. Ramchandran, “A Robust Optimization Solution to the Data Hiding Problem using Distributed Source Coding Principles,” Proc. SPIE, Vol. 3971, San Jose, CA, Jan. 2000.

    Google Scholar 

  10. J. J. Eggers, J. K. Su and B. Girod, “A Blind Watermarking Scheme Based on Structured Codebooks,” Proc. IEE Secure Images and Image Authentication, London, UK, Apr. 2000.

    Google Scholar 

  11. M. Kesal, K. M. Míhçak, R. Kötter and P. Moulin, “Iteratively Decodable Codes for Watermarking Applications,” Proc. 2nd Symposium on Turbo Codes and Related Topics, Brest, France, Sep. 2000.

    Google Scholar 

  12. R. Zamir, S. Shamai (Shitz), and U. Erez, “Nested Linear/Lattice Codes for Structured Multiterminal Binning,” IEEE Trans. Info. Thy, Vol. 48, No. 6, pp. 1250–1276, June 2002.

    Article  MATH  Google Scholar 

  13. A. Somekh-Baruch and N. Merhav, “On the Capacity Game of Public Watermarking Systems,” preprint, Apr. 2002. Available from http://tiger.technion.ac.il/users/merhav.

  14. P. Moulin and M. K. Míhçak, “The Parallel-GaussianWatermarking Game,” UIUC TR UIUC-ENG-01-2214, 2001. Available from http://www.ifp.uiuc.edu/~moulin.

  15. P. Moulin and M. K. Míhçak, “A Framework for Evaluating the Data-Hiding Capacity of Image Sources,” IEEE Trans. on Image Processing, Vol. 11, No. 9, pp. 1029–1042, Sep. 2002.

    Article  Google Scholar 

  16. A. S. Cohen and A. Lapidoth, “The Gaussian Watermarking Game,” IEEE Trans. Info. Thy, Vol. 48, No. 6, pp. 1639–1667, June 2002.

    Article  MATH  MathSciNet  Google Scholar 

  17. W. Yu et al., “Writing on Colored Paper,” Proc. IEEE Int. Symp. on Info. Thy, p. 302, Washington, D.C., 2001.

    Google Scholar 

  18. J. Chou and K. Ramchandran, “Robust turbo-based data hiding for image and video sources,” Proc. IEEE Int. Conf. on Image Processing, Rochester, NY, 2002.

    Google Scholar 

  19. M. K. Míhçak and P. Moulin, “Information-Embedding Codes Matched to Local Gaussian Image Models,” Proc. IEEE Int. Conf. on Im. Proc., Rochester, NY, 2002.

    Google Scholar 

  20. N. Merhav, “On Random Coding Error Exponents of Watermarking Codes,” IEEE Trans. Info Thy, Vol. 46, No. 2, pp. 420–430, Mar. 2000.

    Article  MATH  MathSciNet  Google Scholar 

  21. P. Moulin and J. A. O’sullivan, “Optimal Key Design in Information-Embedding Systems,” Proc. CISS’02, Princeton, NJ, March 2002.

    Google Scholar 

  22. P. Moulin and A. Ivanović, “The Fisher Information Game for Optimal Design of Synchronization Patterns in Blind Watermarking,” Proc. IEEE Int. Conf. on Image Processing, Thessaloniki, Greece, Oct. 2001.

    Google Scholar 

  23. Y. Steinberg and N. Merhav, “Identification in the Presence of Side Information with Application to Watermarking,” IEEE Trans. Info. Thy, Vol. 47, No. 4, pp. 1410–1422, May 2001.

    Article  MATH  MathSciNet  Google Scholar 

  24. E. Martinian and G. W. Wornell, “Authentication with Distortion Constraints”, Proc. IEEE Int. Conf. on Image Processing, pp. II.17–20, Rochester, NY, 2002.

    Google Scholar 

  25. A. Ivanović and P. Moulin, “Game-Theoretic Performance Analysis of Image Watermark Detectors,” Proc. IEEE Int. Conf. on Im. Proc., Rochester, NY, 2002.

    Google Scholar 

  26. P. Moulin and A. Ivanović, “The Zero-Rate Spread-Spectrum Watermarking Game,” to appear in IEEE Transactions on Signal Processing, Apr. 2003.

    Google Scholar 

  27. D. Boneh and J. Shaw, “Collusion-Secure Fingerprinting for Digital Data,” IEEE Trans. Info. Thy, Vol. 44, No. 5, pp. 1897–1905, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  28. P. Moulin and A. Briassouli, “The Gaussian Fingerprinting Game,” Proc. CISS’02, Princeton, NJ, March 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beckman Inst., Coord. Sci. Lab & ECE Dept., University of Illinois, 61801, Urbana, IL, USA

    Pierre Moulin

Authors
  1. Pierre Moulin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research, 7 J. J. Thomson Avenue, CB3 0FB, Cambridge, UK

    Hyoung Joong Kim

  2. Department of Control and Instrumentation Engineering, Kangwon National University, 200-701, Chunchon, Korea

    Hyoung Joong Kim

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moulin, P. (2003). Information-Hiding Games. In: Kim, H.J. (eds) Digital Watermarking. IWDW 2002. Lecture Notes in Computer Science, vol 2613. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36617-2_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-36617-2_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-01217-7

  • Online ISBN: 978-3-540-36617-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation