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.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsFabien A. P. Petitcolas, Hyoung Joong Kim
PublisherSpringer-Verlag Berlin Heidelberg
Pages1-12
Number of pages12
ISBN (Print)3540012176, 9783540012177
DOIs
StatePublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2613
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Information-hiding games'. Together they form a unique fingerprint.

  • Cite this

    Moulin, P. (2003). Information-hiding games. In F. A. P. Petitcolas, & H. J. Kim (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 1-12). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2613). Springer-Verlag Berlin Heidelberg. https://doi.org/10.1007/3-540-36617-2_1