General construction of asymmetric watermarking based on permutations

Digital watermarking is a promising way to protect copyrights for digital contents. So far, most watermarking schemes are symmetric and they can´t provide the public detections. To resolve this problem, some asymmetric schemes are proposed in the recent years. In this paper, we propose a general method to construct the asymmetric watermarking schemes by using permutations, in which the embedding watermarks are the weighted sum of the public watermarks and their permuted versions. The securities are discussed and a scheme based on Chebyshev polynomials is presented as well. The scheme is reliable and it is able to provide minimum security, which is demonstrated in the computer simulations.