Steganography: a class of secure and robust algorithms

This research work presents a new class of non-blind information hiding algorithms that are stego-secure and robust. They are based on some finite domains iterations having the Devaney's topological chaos property. Thanks to a complete formalization of the approach we prove security against watermark-only attacks of a large class of steganographic algorithms. Finally a complete study of robustness is given in frequency DWT and DCT domains.Comment: Published in The Computer Journal special issue about steganograph

Improving random number generators by chaotic iterations. Application in data hiding

In this paper, a new pseudo-random number generator (PRNG) based on chaotic iterations is proposed. This method also combines the digits of two XORshifts PRNGs. The statistical properties of this new generator are improved: the generated sequences can pass all the DieHARD statistical test suite. In addition, this generator behaves chaotically, as defined by Devaney. This makes our generator suitable for cryptographic applications. An illustration in the field of data hiding is presented and the robustness of the obtained data hiding algorithm against attacks is evaluated.Comment: 6 pages, 8 figures, In ICCASM 2010, Int. Conf. on Computer Application and System Modeling, Taiyuan, China, pages ***--***, October 201

A Color Image Watermarking Scheme Based On QR Factorization, Logistic and Lorentz Chaotic Maps

Most of the existing color image watermarking schemes use grayscale or binary image as watermark because color image watermark has more data than grayscale or binary watermark. Therefore, it is a challenging issue to design a color image-watermarking scheme. This paper proposes a novel color image watermarking scheme to embed color image watermark into color host image. In watermarking schemes, first divide the host and watermark image into non-overlapping blocks, apply the Discrete Cosine Transformation (DCT) on each blocks of both watermark, and host image. After that QR Factorization, apply on the each blocks of watermark. In this paper, Logistic and Lorentz chaotic maps are usedfor estimating the embedding strength and location. The experimental results reveal that this watermarking scheme is robust against different image processing attacks viz. cropping, contrast adjustment and coloring

Steganography: a Class of Algorithms having Secure Properties

Chaos-based approaches are frequently proposed in information hiding, but without obvious justification. Indeed, the reason why chaos is useful to tackle with discretion, robustness, or security, is rarely elucidated. This research work presents a new class of non-blind information hidingalgorithms based on some finite domains iterations that are Devaney's topologically chaotic. The approach is entirely formalized and reasons to take place into the mathematical theory of chaos are explained. Finally, stego-security and chaos security are consequently proven for a large class of algorithms.Comment: 4 pages, published in Seventh International Conference on Intelligent Information Hiding and Multimedia Signal Processing, IIH-MSP 2011, Dalian, China, October 14-16, 201