Decoding Fingerprinting Using the Markov Chain Monte Carlo Method

Abstract : This paper proposes a new fingerprinting decoder based on the Markov Chain Monte Carlo (MCMC) method. A Gibbs sampler generates groups of users according to the poste- rior probability that these users could have forged the sequence extracted from the pirated content. The marginal probability that a given user pertains to the collusion is then estimated by a Monte Carlo method. The users having the biggest empirical marginal probabilities are accused. This MCMC method can decode any type of fingerprinting codes. This paper is in the spirit of the 'Learn and Match' decoding strategy: it assumes that the collusion attack belongs to a family of models. The Expectation-Maximization algorithm estimates the parameters of the collusion model from the extracted se- quence. This part of the algorithm is described for the binary Tardos code and with the exploitation of the soft outputs of the watermarking decoder. The experimental body considers some extreme setups where the fingerprinting code lengths are very small. It reveals that the weak link of our approach is the estimation part. This is a clear warning to the 'Learn and Match' decoding strategy.
Document type :
Conference papers
WIFS - IEEE Workshop on Information Forensics and Security, Dec 2012, Tenerife, Spain. IEEE, 2012


https://hal.inria.fr/hal-00757152
Contributor : Teddy Furon <>
Submitted on : Monday, November 26, 2012 - 1:54:02 PM
Last modification on : Monday, May 18, 2015 - 1:09:35 AM

File

paper.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00757152, version 1

Collections

Citation

Teddy Furon, Arnaud Guyader, Frédéric Cérou. Decoding Fingerprinting Using the Markov Chain Monte Carlo Method. WIFS - IEEE Workshop on Information Forensics and Security, Dec 2012, Tenerife, Spain. IEEE, 2012. <hal-00757152>

Export

Share

Metrics

Consultation de
la notice

170

Téléchargement du document

75