Abstract
Watermarking techniques allow the tracing of pirated copies of data by modifying each copy as it is distributed, embedding hidden information into the data which identifies the owner of that copy. The owner of the original data can then identify the source of a pirated copy by reading out the hidden information present in that copy. Naturally, one would like these schemes to be as efficient as possible. Previous analyses easured efficiency in terms of the amount of data needed to allow any different copies to be distributed; in order to hide enough data to distinguish many users, the total original data must be sufficiently large. ere, we consider a different notion of efficiency: What resources does the watermark detector need in order to perform this tracing?
We address this question in two ways. First, we present a modified version of the CKLS media watermarking algorithm which improves the detector running time from linear to polylogarithmic in the number of users while still maintaining collusion-security. Second, we show that any public, invertible watermarking scheme secure against c colluding adversaries must have at least Ω(c) bits of secret information.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
D. Boneh and J. Shaw. Collusion secure fingerprinting for digital data. IEEE Transactions on Information Theory, 44(5):1897–1905, 1998.
B. Chor, A. Fiat, and M. Naor. Tracing traitors. In Crypto’ 94, pages 257–270, 1994.
I. Cox, J. Kilian, T. Leighton, and T. Shamoon. Secure spread spectrum watermarking for multimedia. IEEE Transactions on Image Processing, 6:1673–1687, 1997.
F. Ergun, J. Kilian, and R. Kumar. A note on the limits of collusion-resistant watermarks. In Eurocrypt’ 99, pages 140–149, 1999.
V. Guruswami and M. Sudan. Improved decoding of reed-solomon and algebraic-geometric codes. IEEE Transactions on Information Theory, 45(6):1757–1767, September 1999.
J. Kilian, F. T. Leighton, L. R. Matheson, T. G. Shamoon, R. E. Tarjan, and F. Zane. Resistance of digital fingerprints to collusional attacks. In Proceedings of 1998 IEEE International Symposium on Information Theory, page 271, Cambridge, MA, August 1998. Full version available as Princeton CS TR-585-98.
F.A.P. Petitcolas and R.J. Anderson. Evaluation of copyright marking systems. In IEEE Multimedia Systems (ICMCS’99), pages 574–579, 1999.
F.A.P. Petitcolas, R.J. Anderson, and M.G. Kuhn. Attacks on copyright marking systems. In Second International Workshop on Information Hiding, pages 219–239, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zane, F. (2001). Efficient Watermark Detection and Collusion Security. In: Frankel, Y. (eds) Financial Cryptography. FC 2000. Lecture Notes in Computer Science, vol 1962. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45472-1_2
Download citation
DOI: https://doi.org/10.1007/3-540-45472-1_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42700-1
Online ISBN: 978-3-540-45472-4
eBook Packages: Springer Book Archive