inria-00121958, version 2
Practical Construction Against Theoretical Approach in Fingerprinting
N° RR-6080 (2006)
Résumé : 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.
- a – INRIA
- 1 :
- CNRS : UMR6074 – INRIA – Université de Rennes 1
- Domaine : Informatique/Cryptographie et sécurité
- Mots-clés : bound – capacity – centered error correcting codes – construction – covering codes – fingerprinting – random codes – Reed-Solomon codes – marking assumption – distortion assumption
- Référence interne : RR-6080
- Versions disponibles : v1 (22-12-2006) v2 (27-12-2006)
- inria-00121958, version 2
- http://hal.inria.fr/inria-00121958
- oai:hal.inria.fr:inria-00121958
- Contributeur :
- Soumis le : Mercredi 27 Décembre 2006, 10:58:08
- Dernière modification le : Mercredi 27 Décembre 2006, 10:58:41
Documents associés
Exporter