Practical Construction Against Theoretical Approach in Fingerprinting

We consider fingerprinting under collusion attacks in the Hamming space. To model the attacks we use the framework of Somekh-Baruch and Merhav, IEEE Trans, on Inf. Th.9 vol. 51(3), 2005. We construct a family of fingerprinting codes efficient against coalition of arbitrary size. Using this family, tracing dishonest users can be done without error and in polynomial time. The number of users is exponential in the length. The proposed construction relies on centered error correcting codes. Our results have an amazing relation with an upper bound on the number of users derived by Somekh-Baruch and Merhav: dropping two assumptions that they used we construct codes beating their bound