Steganography Based on Pattern Languages

Sebastian Berndt; Rüdiger Reischuk

doi:10.1007/978-3-319-30000-9_30

Steganography Based on Pattern Languages

Sebastian Berndt, Rüdiger Reischuk

Institute of Theoretical Computer Science

Abstract

In order to transmit secret messages such that the information exchange itself cannot be detected, steganography needs a channel, a set of strings with some distribution that occur in an ordinary communication. The elements of such a language or concept are called cover documents. The question how to design secure stegosystems for natural classes of languages is investigated for pattern languages. We present a randomized modification scheme for strings of a pattern language that can reliably encode arbitrary messages and is almost undetectable.

Original language	English
Title of host publication	Language and Automata Theory and Applications
Editors	Adrian-Horia Dediu, Jan Janoušek, Carlos Martín-Vide, Bianca Truthe
Number of pages	13
Publisher	Springer Verlag
Publication date	26.02.2016
Pages	387-399
ISBN (Print)	978-3-319-29999-0
ISBN (Electronic)	978-3-319-30000-9
DOIs	https://doi.org/10.1007/978-3-319-30000-9_30
Publication status	Published - 26.02.2016
Event	LATA 2016 - Prague, Czech Republic Duration: 14.03.2016 → 18.03.2016

UN SDGs

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

Access to Document

10.1007/978-3-319-30000-9_30

Cite this

@inproceedings{b9a7f4d8d7b6428d939db008e9f526d3,

title = "Steganography Based on Pattern Languages",

abstract = "In order to transmit secret messages such that the information exchange itself cannot be detected, steganography needs a channel, a set of strings with some distribution that occur in an ordinary communication. The elements of such a language or concept are called cover documents. The question how to design secure stegosystems for natural classes of languages is investigated for pattern languages. We present a randomized modification scheme for strings of a pattern language that can reliably encode arbitrary messages and is almost undetectable.",

author = "Sebastian Berndt and R{\"u}diger Reischuk",

year = "2016",

month = feb,

day = "26",

doi = "10.1007/978-3-319-30000-9\_30",

language = "English",

isbn = "978-3-319-29999-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "387--399",

editor = "Dediu, \{Adrian-Horia \} and Janou{\v s}ek, \{Jan \} and Mart{\'i}n-Vide, \{Carlos \} and Truthe, \{Bianca \}",

booktitle = "Language and Automata Theory and Applications",

note = "LATA 2016 ; Conference date: 14-03-2016 Through 18-03-2016",

}

Steganography Based on Pattern Languages. / Berndt, Sebastian; Reischuk, Rüdiger.
Language and Automata Theory and Applications. ed. / Adrian-Horia Dediu; Jan Janoušek; Carlos Martín-Vide; Bianca Truthe. Springer Verlag, 2016. p. 387-399 (Lecture Notes in Computer Science).

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

TY - GEN

T1 - Steganography Based on Pattern Languages

AU - Berndt, Sebastian

AU - Reischuk, Rüdiger

PY - 2016/2/26

Y1 - 2016/2/26

N2 - In order to transmit secret messages such that the information exchange itself cannot be detected, steganography needs a channel, a set of strings with some distribution that occur in an ordinary communication. The elements of such a language or concept are called cover documents. The question how to design secure stegosystems for natural classes of languages is investigated for pattern languages. We present a randomized modification scheme for strings of a pattern language that can reliably encode arbitrary messages and is almost undetectable.

AB - In order to transmit secret messages such that the information exchange itself cannot be detected, steganography needs a channel, a set of strings with some distribution that occur in an ordinary communication. The elements of such a language or concept are called cover documents. The question how to design secure stegosystems for natural classes of languages is investigated for pattern languages. We present a randomized modification scheme for strings of a pattern language that can reliably encode arbitrary messages and is almost undetectable.

U2 - 10.1007/978-3-319-30000-9_30

DO - 10.1007/978-3-319-30000-9_30

M3 - Conference contribution

SN - 978-3-319-29999-0

T3 - Lecture Notes in Computer Science

SP - 387

EP - 399

BT - Language and Automata Theory and Applications

A2 - Dediu, Adrian-Horia

A2 - Janoušek, Jan

A2 - Martín-Vide, Carlos

A2 - Truthe, Bianca

PB - Springer Verlag

T2 - LATA 2016

Y2 - 14 March 2016 through 18 March 2016

ER -

Steganography Based on Pattern Languages

Abstract

UN SDGs

Access to Document

Fingerprint

Cite this