Skip to main content
SpringerLink
Log in

Coverings, centered codes, and combinatorial steganography

  • Information Protection
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

It is shown that steganography with a given distortion criteria, which we call combinatorial steganography, is equivalent to coverings of Hamming spaces or to so-called centered error-correcting codes, depending on whether an opponent is passive or active, respectively. A construction of centered error-correcting codes based on Reed-Solomon and algebraic geometry codes is proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Simmons, G.J., The Prisoner’s Problem and the Subliminal Channel, Advances in Cryptology: Proc. CRYPTO’83 (Workshop on Communication Security), D. Chaum, Ed., New York: Plenum, 1984, pp. 51–67.

    Google Scholar 

  2. Cachin, C., An Information-Theoretic Model for Steganography, Proc. 2nd Int. Workshop on Information Hiding, Portland, USA, 1998, Aucsmith, D., Ed., Lect. Notes Comp. Sci., vol. 1525, Berlin: Springer, 1998, pp. 306–318.

    Google Scholar 

  3. Ryabko, B.Ya. and Ryabko, D.B., Asymptotically Optimal Perfect Steganographic Systems, Probl. Peredachi Inf., 2009, vol. 45, no. 2, pp. 119–126 [Probl. Inf. Trans. (Engl. Transl.), 2009, vol. 45, no. 2, pp. 184–190].

    MathSciNet  Google Scholar 

  4. Bassalygo, L.A. and Pinsker, M.S., Centered Error-Correcting Codes, Probl. Peredachi Inf., 1999, vol. 35, no. 1, pp. 30–37 [Probl. Inf. Trans. (Engl. Transl.), 1999, vol. 35, no. 1, pp. 25–31].

    MathSciNet  Google Scholar 

  5. Somekh-Baruch, A. and Merhav, N., On the Capacity Game of Private Fingerprinting Systems under Collusion Attacks, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 3, pp. 884–899.

    Article  MathSciNet  Google Scholar 

  6. Galand, F. and Kabatiansky, G., Steganography via Covering Codes, in Proc. 2003 IEEE Int. Sympos. on Information Theory (ISIT’03), Yokohama, Japan, pp. 192.

  7. Galand, F. and Kabatiansky, G., Information Hiding by Coverings, in Proc. 2003 IEEE Information Theory Workshop, Paris, France, pp. 151–154.

  8. Galand, F., Practical Construction against Theoretical Approach in Fingerprinting, in Proc. 2006 IEEE Int. Sympos. on Information Theory (ISIT’06), Seattle, USA, pp. 2603–2606.

  9. Cohen, G., Honkala, I., Listyn, S., and Lobstein, A., Covering Codes, Amsterdam: North-Holland, 1997.

    MATH  Google Scholar 

  10. Vlăduţ, S.G., Nogin, D.Yu., and Tsfasman, M.A., Algebrogeometricheskie kody. Osnovnye ponyatiya (Algebraic Geometry Codes. Basic Notions), Moscow: MCCME, 2003.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRISA, Rennes, France

    F. Galand

  2. Kharkevich Institute for Information Transmission Problems, RAS, Moscow, Russia

    G. A. Kabatiansky

Authors
  1. F. Galand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. A. Kabatiansky
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to F. Galand.

Additional information

Original Russian Text © F. Galand, G.A. Kabatiansky, 2009, published in Problemy Peredachi Informatsii, 2009, Vol. 45, No. 3, pp. 106–111.

Supported in part by the Russian Foundation for Basic Research, project nos. 09-01-00536 and 08-07-92495-CNRS-a.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Galand, F., Kabatiansky, G.A. Coverings, centered codes, and combinatorial steganography. Probl Inf Transm 45, 289–294 (2009). https://doi.org/10.1134/S0032946009030107

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946009030107

Search

Navigation