The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Natural watermarking: a secure spread spectrum technique for WOA
IH'06 Proceedings of the 8th international conference on Information hiding
Information-theoretic analysis of security in side-informed data hiding
IH'05 Proceedings of the 7th international conference on Information Hiding
Fundamentals of data hiding security and their application to spread-spectrum analysis
IH'05 Proceedings of the 7th international conference on Information Hiding
Improved spread spectrum: a new modulation technique for robust watermarking
IEEE Transactions on Signal Processing
Scalar Costa scheme for information embedding
IEEE Transactions on Signal Processing
IEEE Transactions on Information Theory
Applying informed coding and embedding to design a robust high-capacity watermark
IEEE Transactions on Image Processing
Fast and robust fixed-point algorithms for independent component analysis
IEEE Transactions on Neural Networks
Proceedings of the 9th workshop on Multimedia & security
Spread-spectrum watermarking security
IEEE Transactions on Information Forensics and Security
Practical security analysis of dirty paper trellis watermarking
IH'07 Proceedings of the 9th international conference on Information hiding
Provably secure spread-spectrum watermarking schemes in the known message attack framework
IH'10 Proceedings of the 12th international conference on Information hiding
A new spread spectrum watermarking scheme to achieve a trade-off between security and robustness
IH'10 Proceedings of the 12th international conference on Information hiding
| Hi-index | 0.00 |
This paper presents two watermarking schemes that are secure when considering the Watermarked content Only Attack (WOA) framework. The definition of watermark security is first recalled and the distinction between key-security and subspace- security classes for Spread Spectrum (SS) watermarking schemes is presented afterwards. Blind source separation techniques are also recalled as a tool to assess the security of a SS watermarking scheme and prove that classical SS and Improved SS are not secure within the WOA framework. To further illustrate these security issues, we next build on a new watermarking scheme called Natural Watermarking (NW). We prove it to be subspace-secure under specific hypotheses. Natural watermarking does not change the Gaussian natural distributions of the projection of each carriers. Furthermore NWprevents estimations both of the watermark subspace (subspace-security) and the different carriers (key-security). We then extend the nice properties of NW to derive the more general family of Circular Watermarking schemes which are key-secure and may offer a better robustness to AWGN attack than NW. An implementation of CW based on ISS is next proposed and comparison of bit error rates for NW, CW, SS and ISS finally draws some conclusions on the robustness cost to achieve security.