On Resolving Rightful Ownership's of Digital Images by Invisible Watermarks
ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 1 - Volume 1
Watermarking Methods for MPEG Encoded Video: Towards Resolving Rightful Ownership
ICMCS '98 Proceedings of the IEEE International Conference on Multimedia Computing and Systems
Watermarking schemes provably secure against copy and ambiguity attacks
Proceedings of the 3rd ACM workshop on Digital rights management
Watermarking and ownership problem: a revisit
Proceedings of the 5th ACM workshop on Digital rights management
Zero-knowledge watermark detection resistant to ambiguity attacks
MM&Sec '06 Proceedings of the 8th workshop on Multimedia and security
On the possibility of non-invertible watermarking schemes
IH'04 Proceedings of the 6th international conference on Information Hiding
A robust protocol for proving ownership of multimedia content
IEEE Transactions on Multimedia
IEEE Transactions on Information Theory
IEEE Journal on Selected Areas in Communications
Secure spread spectrum watermarking for multimedia
IEEE Transactions on Image Processing
| Hi-index | 0.00 |
Watermarking based ownership dispute resolution schemes are vulnerable to a simple but effective class of attacks, called ambiguity attacks, which cast doubt on the reliability of resulting decision by exploiting the high false-positive rate of the watermarking scheme. To mitigate such attacks, we propose a new scheme that embeds multiple watermarks, as opposed to embedding a single watermark, while constraining the embedding distortion, and detects a randomly selected subset of them during an ownership proof. The crux of the scheme lies in both watermark generation, which deploys a family of one-way functions, and selective detection, which injects uncertainty to detection process. The reduction in false-positive probability is analyzed and compared to single watermark embedding for the additive watermarking technique through numerical solutions. Moreover, we examine the exact security level that can be achieved by our scheme with different combinations of parameters. We adopt a previous security proof of non-invertible watermarking schemes with modified notion of security that is more realistic in practice, which allows us to derive the achievable security with typical parameters.