Grey-Box Steganography

Maciej Liskiewicz; Rüdiger Reischuk; Ulrich Wölfel

doi:10.1007/978-3-642-20877-5_38

Grey-Box Steganography

Maciej Liskiewicz, Rüdiger Reischuk, Ulrich Wölfel

Institute of Theoretical Computer Science

Abstract

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 language	English
Title of host publication	Theory and Applications of Models of Computation
Editors	Mitsunori Ogihara, Jun Tarui
Number of pages	13
Volume	6648
Place of Publication	Berlin, Heidelberg
Publisher	Springer Berlin Heidelberg
Publication date	03.2011
Pages	390-402
ISBN (Print)	978-3-642-20876-8
ISBN (Electronic)	978-3-642-20877-5
DOIs	https://doi.org/10.1007/978-3-642-20877-5_38
Publication status	Published - 03.2011
Event	8th Annual Conference, TAMC 2011 - Tokyo, Japan Duration: 23.03.2011 → 25.03.2011

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.1007/978-3-642-20877-5_38

https://link.springer.com/chapter/10.1007/978-3-642-20877-5_38

Cite this

@inproceedings{912aa515f14d418fa7b4e65b7b08b9cd,

title = "Grey-Box Steganography",

abstract = "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.",

author = "Maciej Liskiewicz and R{\"u}diger Reischuk and Ulrich W{\"o}lfel",

year = "2011",

month = mar,

doi = "10.1007/978-3-642-20877-5_38",

language = "English",

isbn = "978-3-642-20876-8",

volume = "6648",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "390--402",

editor = "Mitsunori Ogihara and Jun Tarui",

booktitle = "Theory and Applications of Models of Computation",

note = "8th Annual Conference, TAMC 2011 ; Conference date: 23-03-2011 Through 25-03-2011",

}

Liskiewicz, M, Reischuk, R & Wölfel, U 2011, Grey-Box Steganography. in M Ogihara & J Tarui (eds), Theory and Applications of Models of Computation. vol. 6648, Lecture Notes in Computer Science, vol. 6648, Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 390-402, 8th Annual Conference, TAMC 2011, Tokyo, Japan, 23.03.11. https://doi.org/10.1007/978-3-642-20877-5_38

Grey-Box Steganography. / Liskiewicz, Maciej; Reischuk, Rüdiger; Wölfel, Ulrich.
Theory and Applications of Models of Computation. ed. / Mitsunori Ogihara; Jun Tarui. Vol. 6648 Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. p. 390-402 (Lecture Notes in Computer Science; Vol. 6648).

Research output: Chapters in Books/Reports/Conference Proceedings › Conference contribution › peer-review

TY - GEN

T1 - Grey-Box Steganography

AU - Liskiewicz, Maciej

AU - Reischuk, Rüdiger

AU - Wölfel, Ulrich

PY - 2011/3

Y1 - 2011/3

N2 - 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.

AB - 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.

U2 - 10.1007/978-3-642-20877-5_38

DO - 10.1007/978-3-642-20877-5_38

M3 - Conference contribution

SN - 978-3-642-20876-8

VL - 6648

T3 - Lecture Notes in Computer Science

SP - 390

EP - 402

BT - Theory and Applications of Models of Computation

A2 - Ogihara, Mitsunori

A2 - Tarui, Jun

PB - Springer Berlin Heidelberg

CY - Berlin, Heidelberg

T2 - 8th Annual Conference, TAMC 2011

Y2 - 23 March 2011 through 25 March 2011

ER -

Grey-Box Steganography

Abstract

UN SDGs

Access to Document

Fingerprint

Cite this