Ensuring message embedding in wet paper steganography

6Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Syndrome coding has been proposed by Crandall in 1998 as a method to stealthily embed a message in a cover-medium through the use of bounded decoding. In 2005, Fridrich et al. introduced wet paper codes to improve the undetectability of the embedding by enabling the sender to lock some components of the cover-data, according to the nature of the cover-medium and the message. Unfortunately, almost all existing methods solving the bounded decoding syndrome problem with or without locked components have a non-zero probability to fail. In this paper, we introduce a randomized syndrome coding, which guarantees the embedding success with probability one. We analyze the parameters of this new scheme in the case of perfect codes. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Augot, D., Barbier, M., & Fontaine, C. (2011). Ensuring message embedding in wet paper steganography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7089 LNCS, pp. 244–258). https://doi.org/10.1007/978-3-642-25516-8_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free