Abstract
Fingerprinting means making copies of the same data identifiable by hiding additional information (a fingerprint) in the data. Embedding the additional data can be done by watermarking techniques, which are mainly a branch of signal processing. Most watermarking methods, however, do not treat colluding adversaries who have obtained more than one copy, compare their copies, see differences and use this information to make a copy without a fingerprint. Therefore, there are cryptographic fingerprinting methods to obtain collusion tolerance on top of a watermarking layer. But the most important fingerprinting method by Boneh and Shaw excludes a priori any errors on the watermarking layer, i.e., it is assumed that no changes to the fingerprint occur except those based on the information from collusion attacks. This is a stronger assumption than what most underlying watermarking schemes offer.
This assumption can be justified by making each individual mark fault-tolerant on the watermarking layer, e.g., by replication, but that would imply a significant increase in the data size needed. Instead, here we implement the fault tolerance more efficiently on the cryptographic layer by generalizing Boneh and Shaw’s fingerprinting methods. Our remaining assumption on the underlying watermarking is quite reasonable for watermarking methods that would be built according to the best currently known principles.
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
Alon, N., Spencer, J.: The probabilistic method. J. Wiley and Sons, New York (1992)
Biehl, I., Meyer, B.: P rotocols for collusion-secure asymmetric fingerprinting. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 399–412. Springer, Heidelberg (1997)
Blakley, G.R., Mead, C., Purdy, G.B.: Fingerprinting long forgiving messages. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 180–189. Springer, Heidelberg (1986)
Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 452–465. Springer, Heidelberg (1995)
Boneh, D., Shaw, J.: Collusion-secure fingerprinting for digital data. IEEE Transactions on Information Theory, 1897–1905 (1998)
Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257–270. Springer, Heidelberg (1994)
Chee, Y.M.: Turan-type problems in group testing, coding theory and cryptography. Ph.d. thesis, University of Waterloo, Waterloo, Canada (1996)
Cox, I., Kilian, J., Leighton, F.T., Shamoon, T.: A secure, robust watermark for multimedia. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 185–208. Springer, Heidelberg (1996)
Ergun, F., Kilian, J., Kumar, R.: A Note on the Limits of Collusion-Resistant Watermarks. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 140–149. Springer, Heidelberg (1999)
Kilian, J., Leighton, T., Matheson, L.R., Shamoon, T.G., Tarjan, R.E., Zane, F.: Resistance of digital watermarks to collusive attacks. Technical report TR-585-98, Department of Computer Science, Princeton University (1998)
Matheson, L.R., Mitchell, S.G., Shamoon, T.G., Tarjan, R.E., Zane, F.: Robustness and security of digital watermarks. In: Hirschfeld, R. (ed.) FC 1998. LNCS, vol. 1465, pp. 227–240. Springer, Heidelberg (1998)
Petitcolas, F.A.P., Anderson, R.J., Kuhn, M.G.: Attacks on copyright marking systems. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol. 1525, p. 218. Springer, Heidelberg (1998)
Pfitzmann, B., Schunter, M.: Asymmetric fingerprinting. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 84–95. Springer, Heidelberg (1996)
Pfitzmann, B., Waidner, M.: Asymmetric fingerprinting for larger collusions. In: 4th ACM Conference on Computer and Communications Security, pp. 151–160. acm press, New York (1997)
Stinson, D.R., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures.Submi tted to Journal of Statistical Planning and Inference, version (November 1997), from http://cacr.math.uwaterloo.ca/~dstinson/index.html#pubs
Stinson, D.R., Wei, R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. on Discrete Mathematics, 41–53 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guth, HJ., Pfitzmann, B. (2000). Error- and Collusion-Secure Fingerprinting for Digital Data. In: Pfitzmann, A. (eds) Information Hiding. IH 1999. Lecture Notes in Computer Science, vol 1768. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10719724_10
Download citation
DOI: https://doi.org/10.1007/10719724_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67182-4
Online ISBN: 978-3-540-46514-0
eBook Packages: Springer Book Archive