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.
|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|
|Publication status||Published - 26.02.2016|
|Event||LATA 2016 - Prague, Czech Republic|
Duration: 14.03.2016 → 18.03.2016