Algebraic-geometric codes and asymptotic problems
Discrete Applied Mathematics - Special volume on applied algebra, algebraic algorithms, and error-correcting codes
Intersecting codes and separating codes
Discrete Applied Mathematics - Special issue: International workshop on coding and cryptography (WCC 2001)
Universal Single Transition Time Asynchronous State Assignments
IEEE Transactions on Computers
Separating and Completely Separating Systems and Linear Codes
IEEE Transactions on Computers
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
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.