429 research outputs found
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
Application of Steganography for Anonymity through the Internet
In this paper, a novel steganographic scheme based on chaotic iterations is
proposed. This research work takes place into the information hiding security
framework. The applications for anonymity and privacy through the Internet are
regarded too. To guarantee such an anonymity, it should be possible to set up a
secret communication channel into a web page, being both secure and robust. To
achieve this goal, we propose an information hiding scheme being stego-secure,
which is the highest level of security in a well defined and studied category
of attacks called "watermark-only attack". This category of attacks is the best
context to study steganography-based anonymity through the Internet. The
steganalysis of our steganographic process is also studied in order to show it
security in a real test framework.Comment: 14 page
- …