Disclosing secrets in watermarking and data hiding (original) (raw)

Watermarking security part one: Theory

Security, Steganography, and Watermarking of Multimedia Contents VII, 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 common watermarking methods: the substitutive scheme and spread spectrum based techniques. Their security levels are calculated against three kinds of attack.

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.

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.

Review Paper on Security Measures in Digital Watermarking

International journal of engineering research and technology, 2020

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

Digital Watermarking: Applications, Techniques and Attacks

International Journal of Computer Applications, 2012

As information transmission technology progresses, the technology to protect data from unauthorized users also needs to be enhanced. Data can be plagiarized, modified, deleted etc without proper authentication and authorization. Various security mechanisms have evolved that enhances the security of digital media. Each technology to be applied successfully should ensure a balance between the three pillars of security; confidentiality, integrity and availability. Digital watermarking is one such technique. It is a mechanism to monitor the digital media with the help of information residing within the content itself. To put it simply, digital watermarking is embedding of information into source content that can be detected and extracted. Digital watermarking can be applied to media like text, audio, image, video etc. This paper provides a comprehensive idea behind this technology and its usage.

ART OF DIGITAL WATERMARKING -A CLOSER LOOK

— The expansion of the Internet has frequently increased the availability of digital data such as audio, images and videos to the public. Digital watermarking is a technology being developed to ensure and facilitate data authentication, security and copyright protection of digital media. This paper incorporate the detail study watermarking definition, concept and the main contributions in this field such as categories of watermarking process that tell which watermarking method should be used.

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.

Digital Watermarking, Methodology, Techniques, and Attacks: A Review

Iraqi Journal of Science

The use of multimedia technology is growing every day, and it is difficult and time-consuming to provide allowed data while preventing secret information from being used without authorization. The material that has been watermarked can only be accessed by authorized users. Digital watermarking is a popular method for protecting digital data. The embedding of secret data into actual information is the subject of digital watermarking. This paper examines watermarking techniques, methodologies, and attacks, as well as the development of watermarking digital images stored in both the spatial and frequency domains.