We propose a new model of steganography which combines partial knowledge about the type of covertext channel with machine learning techniques to learn the covertext distribution. Stegotexts are constructed by either modifying covertexts or creating new ones, based on the learned hypothesis. We illustrate our concept with channels that can be described by monomials. A generic construction is given showing that besides the learning complexity, the efficiency of secure grey-box steganography depends on the complexity of membership tests and suitable modification procedures. For the concept class monomials we present an efficient algorithm for changing a covertext into a stegotext.
Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation
EditorsMitsunori Ogihara, Jun Tarui
Number of pages13
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Publication date03.2011
ISBN (Print)978-3-642-20876-8
ISBN (Electronic)978-3-642-20877-5
Publication statusPublished - 03.2011
Event8th Annual Conference, TAMC 2011 - Tokyo, Japan
Duration: 23.03.201125.03.2011


Dive into the research topics of 'Grey-Box Steganography'. Together they form a unique fingerprint.

Cite this