Title :
Practical Construction Against Theoretical Approach in Fingerprinting
Author_Institution :
Projet CODES, INRIA Rocquencourt, Le Chesnay
Abstract :
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
Keywords :
Hamming codes; error correction codes; security of data; Hamming space; centered error correcting codes; collusion attacks; fingerprinting codes; polynomial time; Error correction codes; Fingerprint recognition; Forgery; Information theory; Law; Legal factors; Polynomials; Protection; USA Councils; Upper bound;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.262103