CHAOTIC ITERATIONS FOR STEGANOGRAPHY - Stego-security and Chaos-security

Nicolas Friot, Christophe Guyeux, Jacques M. Bahi

Abstract

In this paper is proposed a novel steganographic scheme based on chaotic iterations. This research work takes place into the information hiding security fields. We show that the proposed scheme is stego-secure, which is the highest level of security in a well defined and studied category of attack called ``watermark-only attack''. Additionally, we prove that this scheme presents topological properties so that it is one of the firsts able to face, at least partially, an adversary when considering the others categories of attacks defined in the literature.

References

  1. Bahi, J. and Guyeux, C. (2010a). Hash functions using chaotic iterations. Journal of Algorithms & Computational Technology, 4(2):167-181. Accepted manuscript. To appear.
  2. Bahi, J. and Guyeux, C. (2010b). A new chaos-based watermarking algorithm. In SECRYPT'10, Int. conf. on security and cryptography, pages 455-458, Athens, Greece. SciTePress.
  3. Bahi, J. M. and Guyeux, C. (2010c). A chaos-based approach for information hiding security. arXiv 0034939.
  4. Barni, M., Bartolini, F., and Furon, T. (2003). A general framework for robust watermarking security. Signal Processing, 83(10):2069-2084. Special issue on Security of Data Hiding Technologies, invited paper.
  5. Bergmair, R. and Katzenbeisser, S. (2006). Content-aware steganography: About lazy prisoners and narrowminded wardens. In (Camenisch et al., 2007), pages 109-123.
  6. Bras-Amorós, M. and Domingo-Ferrer, J. (2008). On overlappings of digitized straight lines and shared steganographic file systems. Transactions on Data Privacy, 1(3):131-139.
  7. Cachin, C. (1998). An information-theoretic model for steganography. In Information Hiding, volume 1525 of Lecture Notes in Computer Science, pages 306- 318. Springer Berlin / Heidelberg.
  8. Camenisch, J., Collberg, C. S., Johnson, N. F., and Sallee, P., editors (2007). Information Hiding, 8th International Workshop, IH 2006, Alexandria, VA, USA, July 10-12, 2006. Revised Selcted Papers, volume 4437 of Lecture Notes in Computer Science. Springer.
  9. Cayre, F. and Bas, P. (2008). Kerckhoffs-based embedding security classes for woa data hiding. IEEE Transactions on Information Forensics and Security, 3(1):1- 15.
  10. Cayre, F., Fontaine, C., and Furon, T. (2005). Watermarking security: theory and practice. IEEE Transactions on Signal Processing, 53(10):3976-3987.
  11. Devaney, R. L. (1989). An Introduction to Chaotic Dynamical Systems. Addison-Wesley, Redwood City, CA, 2nd edition.
  12. Domingo-Ferrer, J. and Bras-Amorós, M. (2008). A shared steganographic file system with error correction. In Torra, V. and Narukawa, Y., editors, MDAI, volume 5285 of Lecture Notes in Computer Science, pages 227-238. Springer.
  13. Furon, T. (2002). Security analysis. European Project IST1999-10987 CERTIMARK, Deliverable D.5.5.
  14. Guyeux, C., Friot, N., and Bahi, J. (2010). Chaotic iterations versus spread-spectrum: chaos and stego security. In IIH-MSP'10, 6-th Int. Conf. on Intelligent Information Hiding and Multimedia Signal Processing, pages 208-211, Darmstadt, Germany.
  15. Kalker, T. (2001). Considerations on watermarking security. pages 201-206.
  16. Katzenbeisser, S. and Dittmann, J. (2004). Malicious attacks on media authentication schemes based on invertible watermarks. In Delp, E. J. and Wong, P. W., editors, Security, Steganography, and Watermarking of Multimedia Contents, volume 5306 of Proceedings of SPIE, pages 838-847. SPIE.
  17. Ker, A. D. (2006). Batch steganography and pooled steganalysis. In (Camenisch et al., 2007), pages 265- 281.
  18. Mittelholzer, T. (1999). An information-theoretic approach to steganography and watermarking. In Pfitzmann, A., editor, Information Hiding, volume 1768 of Lecture Notes in Computer Science, pages 1-16, Dresden, Germany. Springer.
  19. Perez-Freire, L., Prez-gonzalez, F., and Comesaa, P. (2006). Secret dither estimation in lattice-quantization data hiding: A set-membership approach. In Delp, E. J. and Wong, P. W., editors, Security, Steganography, and Watermarking of Multimedia Contents, San Jose, California, USA. SPIE.
  20. Shannon, C. E. (1949). Communication theory of secrecy systems. Bell Systems Technical Journal, 28:656-715.
  21. Shujun, L., Qi, L., Wenmin, L., Xuanqin, M., and Yuanlong, C. (2001). Statistical properties of digital piecewise linear chaotic maps and their roles in cryptography and pseudo-random coding. Proceedings of the 8th IMA International Conference on Cryptography and Coding, 1:205-221.
  22. Simmons, G. J. (1984). The prisoners' problem and the subliminal channel. In Advances in Cryptology, Proc. CRYPTO'83, pages 51-67.
Download


Paper Citation


in Harvard Style

Friot N., Guyeux C. and M. Bahi J. (2011). CHAOTIC ITERATIONS FOR STEGANOGRAPHY - Stego-security and Chaos-security . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011) ISBN 978-989-8425-71-3, pages 218-227. DOI: 10.5220/0003545002180227


in Bibtex Style

@conference{secrypt11,
author={Nicolas Friot and Christophe Guyeux and Jacques M. Bahi},
title={CHAOTIC ITERATIONS FOR STEGANOGRAPHY - Stego-security and Chaos-security},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011)},
year={2011},
pages={218-227},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003545002180227},
isbn={978-989-8425-71-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011)
TI - CHAOTIC ITERATIONS FOR STEGANOGRAPHY - Stego-security and Chaos-security
SN - 978-989-8425-71-3
AU - Friot N.
AU - Guyeux C.
AU - M. Bahi J.
PY - 2011
SP - 218
EP - 227
DO - 10.5220/0003545002180227