21745 articles – 15574 Notices  [english version]

inria-00584877, version 1

Wet paper codes and the dual distance in steganography

Carlos Munuera () a, 1, Morgan Barbier () 2

Advances in mathematics of communications (2011)

Résumé : In 1998 Crandall introduced a method based on coding theory to secretly embed a message in a digital support such as an image. Later Fridrich et al. improved this method to minimize the distortion introduced by the embedding; a process called wet paper. However, as previously emphasized in the literature, this method can fail during the embedding step. Here we find sufficient and necessary conditions to guarantee a successful embedding by studying the dual distance of a linear code. Since these results are essentially of combinatorial nature, they can be generalized to systematic codes, a large family containing all linear codes. We also compute the exact number of solutions and point out the relationship between wet paper codes and orthogonal arrays.

  • a –  University of Valladolid
  • 1 :  Universidad de Valladolid
  • Universidad de Valladolid
  • 2 :  TANC (INRIA Saclay - Ile de France)
  • INRIA – Polytechnique - X – CNRS : UMR7161
  • Domaine : Informatique/Cryptographie et sécurité
    Mathématiques/Théorie de l'information et codage
    Informatique/Théorie de l'information et codage
  • Mots-clés : Steganography – Error-correcting codes – wet paper codes – dual distance
 
  • inria-00584877, version 1
  • http://hal.inria.fr/inria-00584877
  • oai:hal.inria.fr:inria-00584877
  • Contributeur : Morgan Barbier <>
  • Soumis le : Lundi 11 Avril 2011, 10:46:56
  • Dernière modification le : Lundi 14 Novembre 2011, 14:21:25