422 research outputs found
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
A Pseudo Random Numbers Generator Based on Chaotic Iterations. Application to Watermarking
In this paper, a new chaotic pseudo-random number generator (PRNG) is
proposed. It combines the well-known ISAAC and XORshift generators with chaotic
iterations. This PRNG possesses important properties of topological chaos and
can successfully pass NIST and TestU01 batteries of tests. This makes our
generator suitable for information security applications like cryptography. As
an illustrative example, an application in the field of watermarking is
presented.Comment: 11 pages, 7 figures, In WISM 2010, Int. Conf. on Web Information
Systems and Mining, volume 6318 of LNCS, Sanya, China, pages 202--211,
October 201
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
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
Lyapunov exponent evaluation of a digital watermarking scheme proven to be secure
In our previous researches, a new digital watermarking scheme based on
chaotic iterations has been introduced. This scheme was both stego-secure and
topologically secure. The stego-security is to face an attacker in the
"watermark only attack" category, whereas the topological security concerns
other categories of attacks. Its Lyapunov exponent is evaluated here, to
quantify the chaos generated by this scheme.
Keywords : Lyapunov exponent; Information hiding; Security; Chaotic
iterations; Digital Watermarking.Comment: 10 page
Wide spread spectrum watermarking with side information and interference cancellation
Nowadays, a popular method used for additive watermarking is wide spread
spectrum. It consists in adding a spread signal into the host document. This
signal is obtained by the sum of a set of carrier vectors, which are modulated
by the bits to be embedded. To extract these embedded bits, weighted
correlations between the watermarked document and the carriers are computed.
Unfortunately, even without any attack, the obtained set of bits can be
corrupted due to the interference with the host signal (host interference) and
also due to the interference with the others carriers (inter-symbols
interference (ISI) due to the non-orthogonality of the carriers). Some recent
watermarking algorithms deal with host interference using side informed
methods, but inter-symbols interference problem is still open. In this paper,
we deal with interference cancellation methods, and we propose to consider ISI
as side information and to integrate it into the host signal. This leads to a
great improvement of extraction performance in term of signal-to-noise ratio
and/or watermark robustness.Comment: 12 pages, 8 figure
- …