HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

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.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, December 27, 2006 - 10:58:08 AM
Last modification on : Friday, February 4, 2022 - 3:18:30 AM
Long-term archiving on: : Monday, September 20, 2010 - 6:14:02 PM


Files produced by the author(s)


  • HAL Id : inria-00121958, version 2


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



Record views


Files downloads