Perturbation Hiding and the Batch Steganography Problem
Information Hiding
Two key estimation techniques for the broken arrows watermarking scheme
Proceedings of the 11th ACM workshop on Multimedia and security
Optimization of natural watermarking using transportation theory
Proceedings of the 11th ACM workshop on Multimedia and security
Spread-spectrum watermarking security
IEEE Transactions on Information Forensics and Security
Watermarking: how secure is the DM-QIM embedding technique?
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
A pseudo random numbers generator based on chaotic iterations: application to watermarking
WISM'10 Proceedings of the 2010 international conference on Web information systems and mining
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
IH'11 Proceedings of the 13th international conference on Information hiding
Non-cryptographic methods for improving real time transmission security and integrity
Annales UMCS, Informatica - Security Systems
A game-theoretic approach to content-adaptive steganography
IH'12 Proceedings of the 14th international conference on Information Hiding
Suitability of chaotic iterations schemes using XORshift for security applications
Journal of Network and Computer Applications
| Hi-index | 0.00 |
It has recently been discovered that using pseudorandom sequences as carriers in spread-spectrum techniques for data-hiding is not at all a sufficient condition for ensuring data-hiding security. Using proper and realistic apriori hypothesis on the messages distribution, it is possible to accurately estimate the secret carriers by casting this estimation problem into a blind source separation problem. After reviewing relevant works on spread-spectrum security for watermarking, we further develop this topic to introduce the concept of security classes which broaden previous notions in watermarking security and fill the gap with steganography security as defined by Cachin. We define four security classes, namely, by order of creasing security: insecurity, key security, subspace security, and stegosecurity. To illustrate these views, we present two new modulations for truly secure watermarking in the watermark-only-attack (WOA) framework. The first one is called natural watermarking and can be made either stegosecure or subspace secure. The second is called circular watermarking and is key secure. We show that circular watermarking has robustness comparable to that of the insecure classical spread spectrum. We shall also propose information leakage measures to highlight the security level of our new spread-spectrum modulations.