Advertisement

A Theoretical Framework for Data-Hiding in Digital and Printed Text Documents

  • R. Villán
  • S. Voloshynovskiy
  • F. Deguillaume
  • Y. Rytsar
  • O. Koval
  • E. Topak
  • E. Rivera
  • T. Pun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3677)

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 x i , 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 x i as a data structure consisting of multiple component fields (features): name, shape, position, orientation, size, color, etc.

References

  1. 1.
    Gel’fand, S., Pinsker, M.: Coding for channel with random parameters. Problems of Control and Information Theory 9, 19–31 (1980)MathSciNetzbMATHGoogle Scholar
  2. 2.
    Eggers, J., Su, J., Girod, B.: A blind watermarking scheme based on structured codebooks. In: Secure Images and Image Authentication, IEE Colloquium, London, UK, pp. 4/1–4/6 (2000)Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2005

Authors and Affiliations

  • R. Villán
    • 1
  • S. Voloshynovskiy
    • 1
  • F. Deguillaume
    • 1
  • Y. Rytsar
    • 1
  • O. Koval
    • 1
  • E. Topak
    • 1
  • E. Rivera
    • 1
  • T. Pun
    • 1
  1. 1.Computer Vision and Multimedia LaboratoryUniversity of GenevaGeneva 4Switzerland

Personalised recommendations