Watermarking security part one: Theory (original) (raw)
Related papers
Watermarking security: Theory and practice
IEEE Transactions on Signal Processing, 2005
This article proposes a theory of watermarking security based on a cryptanalysis point of view. The main idea is that information about the secret key leaks from the observations, for instance watermarked pieces of content, available to the opponent. Tools from information theory (Shannon's mutual information and Fisher's information matrix) can measure this leakage of information. The security level is then defined as the number of observations the attacker needs to successfully estimate the secret key. This theory is applied to two common watermarking methods: the substitutive scheme and the spread spectrum based techniques. Their security levels are calculated against three kinds of attack. The experimental work illustrates how Blind Source Separation (especially Independent Component Analysis) algorithms help the opponent exploiting this information leakage to disclose the secret carriers in the spread spectrum case. Simulations assess the security levels derived in the theoretical part of the article.
Watermarking security part two: Practice
Proceedings of SPIE, 2005
This second part focuses on estimation of secret parameters of some practical watermarking techniques. The first part reveals some theoretical bounds of information leakage about secret keys from observations. However, as usual in information theory, nothing has been said about practical algorithms which pirates use in real life application. Whereas Part One deals with the necessary number of observations to disclose secret keys (see definitions of security levels), this part focuses on the complexity or the computing power of practical estimators. Again, we are inspired here by the work of Shannon as in his famous article [15], he has already made a clear cut between the unicity distance and the work of opponents' algorithm. Our experimental work also illustrates how Blind Source Separation (especially Independent Component Analysis) algorithms help the opponent exploiting this information leakage to disclose the secret carriers in the spread spectrum case. Simulations assess the security levels theoretically derived in Part One.
Watermarking security part two: Practice
Security, Steganography, and Watermarking of Multimedia Contents VII, 2005
This second part focuses on estimation of secret parameters of some practical watermarking techniques. The first part reveals some theoretical bounds of information leakage about secret keys from observations. However, as usual in information theory, nothing has been said about practical algorithms which pirates use in real life application. Whereas Part One deals with the necessary number of observations to disclose secret keys (see definitions of security levels), this part focuses on the complexity or the computing power of practical estimators. Again, we are inspired here by the work of Shannon as in his famous article , he has already made a clear cut between the unicity distance and the work of opponents' algorithm. Our experimental work also illustrates how Blind Source Separation (especially Independent Component Analysis) algorithms help the opponent exploiting this information leakage to disclose the secret carriers in the spread spectrum case. Simulations assess the security levels theoretically derived in Part One.
A New Measure of Watermarking Security: The Effective Key Length
IEEE Transactions on Information Forensics and Security, 2000
Whereas the embedding distortion, the payload and the robustness of digital watermarking schemes are well understood, the notion of security is still not completely well defined. The approach proposed in the last five years is too theoretical and solely considers the embedding process, which is half of the watermarking scheme. This paper proposes a new measure of watermarking security, called the effective key length, which captures the difficulty for the adversary to get access to the watermarking channel. This new methodology is applied here to additive spread spectrum schemes where theoretical and practical computations of the effective key length are proposed. Experimental protocols using either Monte-Carlo simulations, region approximation or rare event probability estimator allow good evaluation of this quantity. For Improved Spread Spectrum (ISS), our analysis exhibits setups where i) the robustness and the security of the scheme are superior to Spread Spectrum and ii) estimating the secret keys from the observations only is not the best way to break the scheme. Moreover a comparison with Correlation Aware Spread Spectrum (CASS) shows that ISS offers a better security than CASS for a given robustness.
This paper provides a historical overview of the meaning of security in watermarking, putting special emphasis on some recent works. Inspired by these works, a definition of watermarking security is introduced and a quantitative measure of security is proposed, showing some new results on quantization-based and spread spectrum methods. * This work was partially funded by Xunta de Galicia under projects PGIDT04 TIC322013PR and PGIDT04 PXIC32202PM; MEC project DIPSTICK, reference TEC2004-02551/TCM; FIS project G03/185, and European Comission through the IST Programme under Contract IST-2002-507932 ECRYPT. ECRYPT disclaimer: the information in this document reflects only the authors' views, is provided as is and no guarantee or warranty is given that the information is fit for any particular purpose. The user thereof uses the information at its sole risk and liability.
The Effective Key Length of Watermarking Schemes
2012
Whereas the embedding distortion, the payload and the robustness of digital watermarking schemes are well understood, the notion of security is still not completely well defined. The approach proposed in the last five years is too theoretical and solely considers the embedding process, which is half of the watermarking scheme. This paper proposes a new measurement of watermarking security, called the effective key length, which captures the difficulty for the adversary to get access to the watermarking channel. This new methodology is applied to additive spread spectrum schemes where theoretical and practical computations of the effective key length are proposed. It shows that these schemes are not secure as soon as the adversary gets observations in the Known Message Attack context.
A Survey of Watermarking Security
Lecture Notes in Computer Science, 2005
Digital watermarking studies have always been driven by the improvement of robustness. Most of articles of this field deal with this criterion, presenting more and more impressive experimental assessments. Some key events in this quest are the use of spread spectrum, the invention of resynchronization schemes, the discovery of side information channel, and the formulation of the opponent actions as a game. On the contrary, security received little attention in the watermarking community. This paper presents a comprehensive overview of this recent topic. We list the typical applications which requires a secure watermarking technique. For each context, a threat analysis is purposed. This presentation allows us to illustrate all the certainties the community has on the subject, browsing all key papers. The end of the paper is devoted to what remains not clear, intuitions and future studies.
Disclosing secrets in watermarking and data hiding
Watermarking security can be seen as the difficulty of estimating the secret keys used in the embedding and detection processes. This paper considers the problem of watermarking security emphasizing the point of view of parameter estimation. The main theoretical and practical results obtained by the authors in this regard are reviewed and discussed. In some cases, the problem posed by secret key estimation resembles other classical estimation problems, but sometimes it is fundamentally different, demanding for new estimation tools or the adaptation of existing techniques.
IJERT-Review Paper on Security Measures in Digital Watermarking
International Journal of Engineering Research and Technology (IJERT), 2020
https://www.ijert.org/review-paper-on-security-measures-in-digital-watermarking https://www.ijert.org/research/review-paper-on-security-measures-in-digital-watermarking-IJERTCONV8IS10021.pdf Watermarking is the technique in which digital data is hidden in carrier signal. Steganography is the process in which digital data (file, message, video etc.) is embedded within another file, message and video. Steganography secures the information from intruders whereas watermarking algorithms are used for keeping the watermark robust to attack. When the intruder wants to penetrate the signal and tries to remove the watermark then quality of the signal is degraded and it becomes useless. There are many area in which information hiding is required. Two type of attacks are there. First one is active attack in which the attacker changes the whole content. Second one is passive attack in which the attacker tries to guess the secured information by eavesdropping. This paper presents different image data hiding attacks.
Practical key length of watermarking systems
2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012
The paper proposes a new approach for evaluating the security levels of digital watermarking schemes, which is more in line with the formulation proposed in cryptography. We first exhibit the class of equivalent decoding keys. These are the keys allowing a reliable decoding of contents watermarked with the secret key. Then, we evaluate the probability that the adversary picks an equivalent key. The smaller this probability, the higher the key length. This concept is illustrated on two main families of watermarking schemes: DC-QIM (Distortion Compensation Quantization Index Modulation) and SS (Spread Spectrum). The trade-off robustness-security is again verified and gives some counter-intuitive results: For instance, the security of SS is a decreasing function of the length of the secret vector at a fixed Document to Watermark power ratio. Additionally, under the Known Message Attack, the practical key length of the watermarking scheme rapidly decreases to 0 bits per symbol.