Steganography: A Class of Secure and Robust Algorithms
Copyright policy )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.
Published in The Computer Journal special issue about steganography
- UNIVERSITE MARIE ET LOUIS PASTEUR France
- UNIVERSITE BESANCON France
- University of Franche-Comté France
FOS: Computer and information sciences, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Computer Science - Cryptography and Security, 000, Cryptography and Security (cs.CR), 004
FOS: Computer and information sciences, [INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR], Computer Science - Cryptography and Security, 000, Cryptography and Security (cs.CR), 004
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).7 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!