Abstract
A pirate is a person who buys a legal copy of a copyrighted work and who reproduces it to sell illegal copies. Artists and authors are worried as they do not get the income which is legally theirs. It has been suggested to mark every copy sold with a unique fingerprint, so that any unauthorised copy may be traced back to the source and the pirate who bought it. The fingerprint must be embedded in such a way that it cannot be destroyed. Two pirates who cooperate, can compare their copies and they will find some bits which differ. These bits must be part of the fingerprint, and when the pirates can see and change these bits, they get an illegal copy with neither of their fingerprints. Collusion-secure fingerprinting schemes are designed to trace at least one of the pirates in such a collusion.
In this paper we prove that socalled (2, 2)-separating codes often are collusion-secure against two pirates. In particular, we consider the best known explicit asymptotic construction of such codes, and prove that it is collusion-secure with better rate than any previously known schemes.
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
A. Barg, G.R. Blakley, and G. Kabatiansky. Good digital fingerprinting Codes. Technical report, DIMACS, 2001.
Dan Boneh and James Shaw. Collusion-secure fingerprinting for digital data. IEEE Trans. Inform. Theory, 44(5):1897–1905, 1998. Presented in part 1995, see Springer LNCS.
Bella Bose and T.R.N. Rao. Separating and completely separating systems and linear Codes. IEEE Trans. Comput., 29(7):665–668, 1980.
Gérard Cohen and Gilles Zemor. Intersecting Codes and independent families. IEEE Trans. Inform. Theory, 40:1872–1881, 1994.
Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, and Hans Georg Schaathun. Intersecting Codes and separating Codes. Discrete Applied Mathematics, 2001. To appear.
A.D. Friedman, R.L. Graham, and J.D. Ullman. Universal single transition time asynchronous state assignments. IEEE Trans. Comput., 18:541–547, 1969.
Jacob Löfvenberg. Codes for Digital Fingerprinting. PhD thesis, Linköpings Universitet, 2001. http://www.it.isy.liu.se/publikationer/index.html.
Yu.L. Sagalovich. A method for increasing the reliability of finite automata. Problems of Information Transmission, 1(2):27–35, 1965.
Yu.L. Sagalovich. Separating systems. Problems of Information Transmission, 30(2):105–123, 1994.
Michael A. Tsfasman. Algebraic-geometric Codes and asymptotic Problems. Discrete Appl. Math., 33(1–3):241–256, 1991. Applied algebra, algebraic algorithms, and error-correcting codes (Toulouse, 1989).
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
Schaathun, H.G. (2003). Fighting Two Pirates. In: Fossorier, M., Høholdt, T., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2003. Lecture Notes in Computer Science, vol 2643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44828-4_9
Download citation
DOI: https://doi.org/10.1007/3-540-44828-4_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40111-7
Online ISBN: 978-3-540-44828-0
eBook Packages: Springer Book Archive