Optimization of tardos's fingerprinting codes in a viewpoint of memory amount

Koji Nuida, Manabu Hagiwara, Hajime Watanabe, Hideki Imai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

23 Citations (Scopus)


It is known that Tardos's collusion-secure probabilistic fingerprinting code (Tardos code) has length of theoretically minimal order. However, Tardos code uses certain continuous probability distribution, which causes that huge amount of extra memory is required in a practical use. An essential solution is to replace the continuous distributions with finite discrete ones, preserving the security. In this paper, we determine the optimal finite distribution for the purpose of reducing memory amount; the required extra memory is reduced to less than 1/32 of the original in some practical setting. Moreover, the code length is also reduced (to, asymptotically, about 20.6% of Tardos code), and some further practical problems such as approximation errors are also considered.

Original languageEnglish
Title of host publicationInformation Hiding - 9th International Workshop, IH 2007, Revised Selected Papers
Number of pages15
Publication statusPublished - 2007
Externally publishedYes
Event9th International Workshop on Information Hiding, IH 2007 - Saint Malo, France
Duration: Jun 11 2007Jun 13 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4567 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference9th International Workshop on Information Hiding, IH 2007
CitySaint Malo

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Optimization of tardos's fingerprinting codes in a viewpoint of memory amount'. Together they form a unique fingerprint.

Cite this