Abstract
This paper addresses the problem of threshold traitor tracing for digital content where, by embedding appropriate digital patterns into the distributed content, it is possible to trace and identify the source of unauthorised redistribution.
We use a set of marking assumptions where the adversaries have varying powers to change or erase coordinates of the fingerprint where their individual fingerprints differ–and consider the implications. We propose new codes derived from combinatorial designs–and develop a method for concatenating these codes to filter out the false positives and defend against some of the attacks considered.
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
Barg, A., Blakely, G.R., Kabatiansky, G.A.: Digital finger printing codes: problem statements, constructions, identification of traitors. IEEE Trans. Inform. Theory 49, 852–865 (2003)
Barg, A., Cohen, G., Encheva, S., Kabatiansky, G., Zemor, G.: A hypergraph approach to the identifying parent property: the case of multiple parents. SIAM Journal of Discrete Math. 14(3), 423–431 (2001)
Boneh, D., Franklin, M.: An efficient public key traitor tracing scheme. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 338–353. Springer, Heidelberg (1999)
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)
Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 257–270. Springer, Heidelberg (1994)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland Publishing Company, Amsterdam (1977)
McNicol, S.: Traitor Tracing Using Generalized Reed-Solomon Codes and Combinatorial Designs. PhD thesis, RMIT University (July 2005)
McNicol, S., Boztaş, S., Rao, A.: Traitor tracing against powerful attacks. In: Proceedings of the IEEE International Symposium on Information Theory, pp. 1878–1882 (2005)
Staddon, J., Stinson, D.R., Wei, R.: Combinatorial properties of frameproof and traceability codes. IEEE Transactions on Information Theory 47, 1042–1049 (2001)
Stinson, D., van Trung, T., Wei, R.: Secure frameproof codes, key distribution patterns, group testing algorithms and related structures. Planning and Inference 86(2), 595–617 (2000)
Tardos, G.: Optimal probabilistic fingerprint codes. In: STOC 2003: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp. 116–125. ACM Press, New York (2003)
Wallis, W.D.: Combinatorial Designs. Marcel Decker Inc., New York (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McNicol, S., Boztaş, S., Rao, A. (2006). Traitor Tracing Against Powerful Attacks Using Combinatorial Designs. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2006. Lecture Notes in Computer Science, vol 3857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617983_21
Download citation
DOI: https://doi.org/10.1007/11617983_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31423-3
Online ISBN: 978-3-540-31424-0
eBook Packages: Computer ScienceComputer Science (R0)