Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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. 119
D. Boneh and J. Shaw. Collusion-secure fingerprinting for digital data. IEEE Trans. on Information Theory, 44(5):1897–1905, 1998. 120
E.C. Chang and M. Orchard. Geometric properties of watermarking schemes. In ICIP, volume 3, pages 714–717, 2000. 121
B. Chen and G.W. Wornell. Achievable performance of digital watermarking systems. IEEE Int. Conf. on Multimedia Computing & Systems, 1:13–18, 1999. 121
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. 121
M. Costa. Writing on dirty paper. IEEE Trans. on Information Theory, 29(3):439–441, 1983. 121
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. 119
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. 119
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. 120
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. 119
P.A. Pevzner. Computational Molecular Biology: An Algorithmic Approach. The MIT Press, 2000. 119, 122
Harold S. Stone. Analysis of attacks on image watermarks with randomized co efficients. Technical report, NEC Research Instititute, 1996. 120
S. Ulam. Adventures of a mathematician. Scribner and Sons, 1976. 119, 122
A. C.-C. Yao. Probabilistic computations: Twoard a unified measure of complexity. 18th IEEE Symposium on Foundations of Computer Science, pages 222–227, 1977. 123
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Q., Ee-Chien, C. (2003). Security of Public Watermarking Schemes for Binary Sequences. In: Petitcolas, F.A.P. (eds) Information Hiding. IH 2002. Lecture Notes in Computer Science, vol 2578. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36415-3_8
Download citation
DOI: https://doi.org/10.1007/3-540-36415-3_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00421-9
Online ISBN: 978-3-540-36415-3
eBook Packages: Springer Book Archive