A theoretical framework for data-hiding in digital and printed text documents

  • Authors:

  • R. Villán;S. Voloshynovskiy;F. Deguillaume;Y. Rytsar;O. Koval;E. Topak;E. Rivera;T. Pun

  • Affiliations:

  • Computer Vision and Multimedia Laboratory, University of Geneva, Geneva 4, Switzerland;Computer Vision and Multimedia Laboratory, University of Geneva, Geneva 4, Switzerland;Computer Vision and Multimedia Laboratory, University of Geneva, Geneva 4, Switzerland;Computer Vision and Multimedia Laboratory, University of Geneva, Geneva 4, Switzerland;Computer Vision and Multimedia Laboratory, University of Geneva, Geneva 4, Switzerland;Computer Vision and Multimedia Laboratory, University of Geneva, Geneva 4, Switzerland;Computer Vision and Multimedia Laboratory, University of Geneva, Geneva 4, Switzerland;Computer Vision and Multimedia Laboratory, University of Geneva, Geneva 4, Switzerland

  • Venue:
  • CMS'05 Proceedings of the 9th IFIP TC-6 TC-11 international conference on Communications and Multimedia Security
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work, we consider the text data-hiding problem as a particular instance of the well-known Gel'fand-Pinsker problem [1]. The text, where some message $m \in \mathcal{M}$ is to be hidden, is represented by x and called cover text. Each component xi, i = 1, 2, ..., N, of x represents one character from this text. Here, we define a character as an element from a given language alphabet (e.g. the latin alphabet {A, B, ..., Z}). To be more precise, we conceive each character xi as a data structure consisting of multiple component fields (features): name, shape, position, orientation, size, color, etc.