Estimating the minimal length of Tardos code

Abstract : This paper estimates the minimal length of a binary proba- bilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetric accusation function as im- proved by B. Skoric et al. The length estimation is based on two pillars. First, we consider the Worst Case Attack that a group of c colluders can lead. This attack minimizes the mutual information between the code sequence of a colluder and the pirated sequence. Second, an algorithm pertaining to the field of rare event analysis is presented in order to es- timate the probabilities of error: the probability that an innocent user is framed, and the probabilities that all colluders are missed. Therefore, for a given collusion size, we are able to estimate the minimal length of the code satisfying some error probabilities constraints. This estimation is far lower than the known lower bounds.
Type de document :
Communication dans un congrès
Information Hiding, Jun 2009, Darmstadt, Germany. Springer Verlag, 5806, 2009, LNCS
Liste complète des métadonnées

Littérature citée [10 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00505882
Contributeur : Teddy Furon <>
Soumis le : lundi 26 juillet 2010 - 14:41:12
Dernière modification le : jeudi 15 novembre 2018 - 11:57:20
Document(s) archivé(s) le : mardi 23 octobre 2012 - 11:20:28

Fichier

IH-2009_name.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00505882, version 1

Citation

Teddy Furon, Luis Pérez-Freire, Arnaud Guyader, Frédéric Cérou. Estimating the minimal length of Tardos code. Information Hiding, Jun 2009, Darmstadt, Germany. Springer Verlag, 5806, 2009, LNCS. 〈inria-00505882〉

Partager

Métriques

Consultations de la notice

570

Téléchargements de fichiers

146