Grey-box steganography

Likiewicz, Maciej; Reischuk, Rüdiger; Wölfel, Ulrich

doi:10.1016/j.tcs.2012.03.037

Cited by 9 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although the central idea was not unique to his work, Sallee coined the phrase model-based steganography [30] to describe a system in which a model of the cover medium provides a conditional probability distribution that is used to embed an encrypted message through source coding. Similar schemes based on source coding have also been proposed for the complexity-theoretic setting, in which the distribution over cover messages is learned through stateful black-box sampling [19] or by modeling the channel as an efficiently learnable concept class [20].…”

Section: Background and Related Workmentioning

confidence: 99%

“…Challenges in practice. While this approach is conceptually straightforward and has been applied in some prior work [6,19,20,30,32,36], there is much to be done in order to address implementation and deployment realities that arise from using generative models, and co-opting large public platforms for covert-message passing. Prior work has largely elided these matters, and most of our system-building effort is aimed at tackling them head-on.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Covert Message Passing over Public Internet Platforms Using Model-Based Format-Transforming Encryption

Bauer¹,

Howes²,

Markelon³

et al. 2021

Preprint

View full text Add to dashboard Cite

We introduce a new type of format-transforming encryption where the format of ciphertexts is implicitly encoded within a machine-learned generative model. Around this primitive, we build a system for covert messaging over large, public internet platforms (e.g., Twitter). Loosely, our system composes an authenticated encryption scheme, with a method for encoding random ciphertext bits into samples from the generative model's family of seed-indexed token-distributions. By fixing a deployment scenario, we are forced to consider systemlevel and algorithmic solutions to real challenges -such as receiver-side parsing ambiguities, and the low informationcarrying capacity of actual token-distributions -that were elided in prior work. We use GPT-2 as our generative model so that our system cryptographically transforms plaintext bitstrings into natural-language covertexts suitable for posting to public platforms. We consider adversaries with full view of the internet platform's content, whose goal is to surface posts that are using our system for covert messaging. We carry out a suite of experiments to provide heuristic evidence of security and to explore tradeoffs between operational efficiency and detectability.

show abstract

Section: Background and Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Covert Message Passing over Public Internet Platforms Using Model-Based Format-Transforming Encryption

Bauer¹,

Howes²,

Markelon³

et al. 2021

Preprint

View full text Add to dashboard Cite

show abstract

“…As in the cryptographic setting, the security of the stegosystems should only rely on the secrecy of the keys used by the system. Symmetric-key steganography, which assumes that Alice and Bob share a secret-key, has been a subject of intensive study both in an information-theoretic [7,36,40] and in a computational setting [13,22,23,25,26,30]. A drawback of such an approach is that the encoder and the decoder must have shared a key in a secure way.…”

Section: Introductionmentioning

confidence: 99%

On the Gold Standard for Security of Universal Steganography

Berndt

Liśkiewicz

2018

Advances in Cryptology – EUROCRYPT 2018

Self Cite

View full text Add to dashboard Cite

While symmetric-key steganography is quite well understood both in the information-theoretic and in the computational setting, many fundamental questions about its public-key counterpart resist persistent attempts to solve them. The computational model for public-key steganography was proposed by von Ahn and Hopper in EUROCRYPT 2004. At TCC 2005, Backes and Cachin gave the first universal public-key stegosystem -i. e. one that works on all channels -achieving security against replayable chosen-covertext attacks (SS-RCCA) and asked whether security against non-replayable chosen-covertext attacks (SS-CCA) is achievable. Later, Hopper (ICALP 2005) provided such a stegosystem for every efficiently sampleable channel, but did not achieve universality. He posed the question whether universality and SS-CCA-security can be achieved simultaneously. No progress on this question has been achieved since more than a decade. In our work we solve Hopper's problem in a somehow complete manner: As our main positive result we design an SS-CCA-secure stegosystem that works for every memoryless channel. On the other hand, we prove that this result is the best possible in the context of universal steganography. We provide a family of 0-memoryless channels -where the already sent documents have only marginal influence on the current distribution -and prove that no SS-CCA-secure steganography for this family exists in the standard non-look-ahead model.

show abstract

Steganography Based on Pattern Languages

Berndt

Reischuk

2016

Language and Automata Theory and Applications

View full text Add to dashboard Cite

Grey-box steganography

Cited by 9 publications

References 27 publications

Covert Message Passing over Public Internet Platforms Using Model-Based Format-Transforming Encryption

Covert Message Passing over Public Internet Platforms Using Model-Based Format-Transforming Encryption

On the Gold Standard for Security of Universal Steganography

Steganography Based on Pattern Languages

Contact Info

Product

Resources

About