Practical Construction Against Theoretical Approach in Fingerprinting

Fabien Galand 1
1 TEMICS - Digital image processing, modeling and communication
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : We consider fingerprinting under collusion attacks in the Hamming space, using the framework of \cite{SBM}. 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 of the code. The proposed construction relies on centered error correcting codes \cite{BP99} for which we discuss two constructions. Our results have an amazing relation with an upper bound on the number of users derived in \cite{SBM}: dropping two assumptions we construct codes beating their bound, still keeping practical properties.
Type de document :
[Research Report] RR-6080, INRIA. 2006
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 27 décembre 2006 - 10:58:08
Dernière modification le : mercredi 16 mai 2018 - 11:23:05
Document(s) archivé(s) le : lundi 20 septembre 2010 - 18:14:02


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00121958, version 2


Fabien Galand. Practical Construction Against Theoretical Approach in Fingerprinting. [Research Report] RR-6080, INRIA. 2006. 〈inria-00121958v2〉



Consultations de la notice


Téléchargements de fichiers