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.
Chapter PDF
Similar content being viewed by others
References
Gel’fand, S., Pinsker, M.: Coding for channel with random parameters. Problems of Control and Information Theory 9, 19–31 (1980)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Villán, R. et al. (2005). A Theoretical Framework for Data-Hiding in Digital and Printed Text Documents. In: Dittmann, J., Katzenbeisser, S., Uhl, A. (eds) Communications and Multimedia Security. CMS 2005. Lecture Notes in Computer Science, vol 3677. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552055_34
Download citation
DOI: https://doi.org/10.1007/11552055_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28791-9
Online ISBN: 978-3-540-31978-8
eBook Packages: Computer ScienceComputer Science (R0)