Security of Public Watermarking Schemes for Binary Sequences
In this paper, we focus on the security aspect of public watermarking schemes. Specifically, given a watermarked sequence Ĩ, we consider smart attackers whose task is to find a non-watermarked sequence I’ using as few calls to the publicly available detection routine as possible. We restrict the media to binary sequences and use Hamming distance as the measure. We study a class of watermarking schemes and give an attacker who uses expected O(d(1 + log(n/k))) calls to find such I’, where d and k are determined by the false alarm and distortion of the scheme, and n is the length of the sequence. This attacker is optimal when k = o(n). By taking the number of calls required as a measure of the security, we can trade-o. the requirements on security, false alarm and distortion.
Unable to display preview. Download preview PDF.
- Andris Ambainis, Stephen A. Bloch, and David L. Schweizer. Playing twenty questions with a procrastinator. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pages 844–845. ACM Press, 1999. 119Google Scholar
- E.C. Chang and M. Orchard. Geometric properties of watermarking schemes. In ICIP, volume 3, pages 714–717, 2000. 121Google Scholar
- B. Chen and G.W. Wornell. Achievable performance of digital watermarking systems. IEEE Int. Conf. on Multimedia Computing & Systems, 1:13–18, 1999. 121Google Scholar
- J. Chou, S. S. Pradhan, and K. Ramchandran. On the duality between distributed source coding and data hiding. 33rd Asilomar conference on Signals, System and Computers, pages 1503–1507, 1999. 121Google Scholar
- M. Costa. Writing on dirty paper. IEEE Trans. on Information Theory, 29(3):439–441, 1983. 121Google Scholar
- I. J. Cox and J-.P. Linnartz. Public watermarks and resistance to tampering. IEEE Int. Conf. on Image Processing, 3(0 3-0 6), 1997. 119Google Scholar
- Aditi Dhagat, Peter Gács, and Peter Winkler. On playing “twenty questions” with a liar. In Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pages 16–22. ACM Press, 1992. 119Google Scholar
- J. Kilian, F. T. Leighton, L.R. Matheson, T. G. Shamoon, R.E. Tarjan, and F. Zane. Resistance of digital watermarks to collusive attacks. In IEEE International Symposium on Information Theory, page 271, 1998. 120Google Scholar
- Fabien A.P. Petitcolas, Ross J. Anderson, and Markus G. Kuhn. Attacks on copyright marking systems. In Information Hiding, Second International Workshop, number 1525 in LNCS, pages 219–239. Springer-Verlag, 1998. 119Google Scholar
- P.A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. The MIT Press, 2000. 119, 122Google Scholar
- Harold S. Stone. Analysis of attacks on image watermarks with randomized co efficients. Technical report, NEC Research Instititute, 1996. 120Google Scholar
- S. Ulam. Adventures of a mathematician. Scribner and Sons, 1976. 119, 122Google Scholar
- A. C.-C. Yao. Probabilistic computations: Twoard a unified measure of complexity. 18th IEEE Symposium on Foundations of Computer Science, pages 222–227, 1977. 123Google Scholar