A simple unpredictable pseudo random number generator
SIAM Journal on Computing
Digital watermarking
Zero Knowledge Watermark Detection
IH '99 Proceedings of the Third International Workshop on Information Hiding
Zero-Knowledge Watermark Detection and Proof of Ownership
IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Watermarking schemes provably secure against copy and ambiguity attacks
Proceedings of the 3rd ACM workshop on Digital rights management
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
IEEE Journal on Selected Areas in Communications
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
Security issues in watermarking applications - a deeper look
Proceedings of the 4th ACM international workshop on Contents protection and security
A new approach to countering ambiguity attacks
Proceedings of the 9th workshop on Multimedia & security
From weak to strong watermarking
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Security models of digital watermarking
MCAM'07 Proceedings of the 2007 international conference on Multimedia content analysis and mining
Non-invertible DWT domain image watermarking using human visual model
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Watermarking protocol compatible with secret algorithms for resisting invertibility attack
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
An efficient dispute resolving method for digital images
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I
| Hi-index | 0.00 |
Recently, there are active discussions on the possibility of non-invertible watermarking scheme. A non-invertible scheme prevents an attacker from deriving a valid watermark from a cover work. Recent results suggest that it is difficult to design a provably secure non-invertible scheme. In contrast, in this paper, we show that it is possible. We give a scheme based on a cryptographically secure pseudo-random number generator (CSPRNG) and show that it is secure with respect to well-accepted notion of security. We employ the spread spectrum method as the underlying watermarking scheme to embed the watermark. The parameters chosen for the underlying scheme give reasonable robustness, false alarm and distortion. We prove the security by showing that, if there is a successful attacker, then there exists a probabilistic polynomial-time algorithm that can distinguish the uniform distribution from sequences generated by the CSPRNG, and thus contradicts the assumption that the CSPRNG is secure. Furthermore, in our scheme the watermark is statistically independent from the original work, which shows that it is not necessary to enforce a relationship between them to achieve non-invertibility.