Ensuring Message Embedding in Wet Paper Steganography

DOI10.1007/978-3-642-25516-8_15MaRDI QIDQ3104699zbMATH OpenOpenAlexFDO

Authors Daniel Augot, Caroline Fontaine, Morgan Barbier

Publication date 16 December 2011

Published in Cryptography and Coding (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1111.2301

zbMATH Keywords

steganographysyndrome coding problemwet paper codes

Mathematics Subject Classification ID

Cryptography (94A60) Bounds on codes (94B65)

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

Recommendations

• Wet paper codes and the dual distance in steganography
• Hamming codes for wet paper steganography
• scientific article; zbMATH DE number 1942414
• Provably Secure Steganography
• Automata, Languages and Programming
• Steganography from a coding theory point of view

Cites work

• An information-theoretic model for steganography
• Coverings, centered codes, and combinatorial steganography
• Fast BCH Syndrome Coding for Steganography
• scientific article; zbMATH DE number 2081064 (Why is no real title available?)
• scientific article; zbMATH DE number 1894623 (Why is no real title available?)
• Near-Optimal Codes for Information Embedding in Gray-Scale Signals
• On the inherent intractability of certain coding problems (Corresp.)
• Random Krylov Spaces over Finite Fields
• The complexity of computing the covering radius of a code
• The intractability of computing the minimum distance of a code
• Wet paper codes and the dual distance in steganography
• Writing on wet paper

Cited in

(3)

• Wet paper codes and the dual distance in steganography
• Hamming codes for wet paper steganography
• Fast BCH Syndrome Coding for Steganography

This page was built for publication: Ensuring Message Embedding in Wet Paper Steganography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104699)