An Asymmetric Watermarking Method in the DCT Domain Based on RC4-Permutation and Chaotic Map

This paper presents an asymmetric watermarking method in the DCT domain for still images based on permutation and chaos. This method uses secret watermark as private key and public watermark as public key. The public watermark has a normal distribution with mean = 0 and variance = 1. The secret watermark is obtained by permutating the public watermark according to combination of a part of RC4 algorithm and a logistic map. The watermark is embedded into mid-frequency components of the DCT block for better robustness. The detection process is implemented by correlation test between the public watermark and the received image. Experiments show that the watermarking method was proved to be robust againts some typical image processings (cropping, JPEG compression, resizing, rotation, sharpening, and noising)

A constructive and unifying framework for zero-bit watermarking

In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the presence of this particular weak signal in content. The article looks at this problem from a classical detection theory point of view, but with side information enabled at the embedding side. This means that the watermark signal is a function of the host content. Our study is twofold. The first step is to design the best embedding function for a given detection function, and the best detection function for a given embedding function. This yields two conditions, which are mixed into one `fundamental' partial differential equation. It appears that many famous watermarking schemes are indeed solution to this `fundamental' equation. This study thus gives birth to a constructive framework unifying solutions, so far perceived as very different.Comment: submitted to IEEE Trans. on Information Forensics and Securit

Asymmetric Watermarking Scheme Based on Shuffling

AbstractIn this paper, a novel asymmetric watermarking scheme is proposed. Both the user side watermark and copyright owner's one are generated from the copyright owner's private keys, and the watermark detection can be finished either by public watermark or the copyright owner's private one. Given the public watermark, it is impossible to guess or remove the embedded watermark. Performance of the proposed scheme is studied and the experimental results against removal attack and Jpeg compression show good robustness of proposed scheme

An unified approach of asymmetric watermarking schemes

International audienceAsymmetric schemes belong to second generation of watermarking. Whereas their need and advantage are well understood, many doubts have been raised about their robustness and security. Four different asymmetric schemes have been proposed up to now. Whereas they were seemingly relying on completely different concepts, they share the same performances. Exploring in detail these concepts, the authors propose a common formulation of the four different detector processes. This allows to stress common features about security of asymmetric schemes

An Asymmetric Public Detection Watermarking Technique

International audienceThe new watermarking technique presented in this paper is an example of an asymmetric public detection scheme

Secure Watermarking for Multimedia Content Protection: A Review of its Benefits and Open Issues

Distribution channels such as digital music downloads, video-on-demand, multimedia social networks, pose new challenges to the design of content protection measures aimed at preventing copyright violations. Digital watermarking has been proposed as a possible brick of such protection systems, providing a means to embed a unique code, as a fingerprint, into each copy of the distributed content. However, application of watermarking for multimedia content protection in realistic scenarios poses several security issues. Secure signal processing, by which name we indicate a set of techniques able to process sensitive signals that have been obfuscated either by encryption or by other privacy-preserving primitives, may offer valuable solutions to the aforementioned issues. More specifically, the adoption of efficient methods for watermark embedding or detection on data that have been secured in some way, which we name in short secure watermarking, provides an elegant way to solve the security concerns of fingerprinting applications. The aim of this contribution is to illustrate recent results regarding secure watermarking to the signal processing community, highlighting both benefits and still open issues. Some of the most interesting challenges in this area, as well as new research directions, will also be discussed