On codes with the identifiable parent property
Journal of Combinatorial Theory Series A
Algebraic-Geometric Codes
Lower bounds for collusion-secure fingerprinting
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Optimal probabilistic fingerprint codes
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
Designs, Codes and Cryptography
A family of asymptotically good binary fingerprinting codes
IEEE Transactions on Information Theory
Collusion-secure fingerprinting for digital data
IEEE Transactions on Information Theory
Improved decoding of Reed-Solomon and algebraic-geometry codes
IEEE Transactions on Information Theory
Efficient decoding of Reed-Solomon codes beyond half the minimum distance
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Combinatorial properties of frameproof and traceability codes
IEEE Transactions on Information Theory
Digital fingerprinting codes: problem statements, constructions, identification of traitors
IEEE Transactions on Information Theory
Applications of list decoding to tracing traitors
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Digital fingerprinting provides a means of tracing unauthorized re-distribution of digital objects. With an unique fingerprint being imperceptibly embedded in each authorized copy of the object, in case a pirate copy is found, by analysing the fingerprint in the observed pirate copy, the distributer can identify the users who produced the pirate copy. Collusion-secure fingerprinting schemes address the problem of collusion, where a group of users (a coalition) detect and change the fingerprint symbols in their copies before producing pirate copies. It has been proved that there exist collusion-secure fingerprinting schemes that can identify at least one member of the coalition for any reasonably sized coalition. In order to guarantee the quality of the object, short fingerprinting codes are preferred in practical applications. A lower bound on the code length has been derived by Peikert et al, that is, any collusion-secure fingerprinting codes must have length at least o(s2log(1/sε)), where s is the size of coalition. Codes which achieve the lower bound are called optimal codes. However, currently known optimal codes do not have any efficient (polynomial time-complexity) tracing procedure to identify the coalition. The best known codes with efficient tracing algorithms, which were constructed by Cortrina-Navau and Fernández in 2010, have length O(s6log(s/ε)log(N)), where N is the total number of authorized users. In this paper, we construct a class of codes which have an efficient tracing algorithm and have length O(s2log(1/ε)log(N)). Our codes are much shorter than those by Cortrina-Navau and Fernández.