An improvement of discrete Tardos fingerprinting codes

Koji Nuida, Satoshi Fujitsu, Manabu Hagiwara, Takashi Kitagawa, Hajime Watanabe, Kazuto Ogawa, Hideki Imai

研究成果: Contribution to journalArticle査読

66 被引用数 (Scopus)


It has been proven that the code lengths of Tardos's collusion-secure fingerprinting codes are of theoretically minimal order with respect to the number of adversarial users (pirates). However, the code lengths can be further reduced as some preceding studies have revealed. In this article we improve a recent discrete variant of Tardos's codes, and give a security proof of our codes under an assumption weaker than the original Marking Assumption. Our analysis shows that our codes have significantly shorter lengths than Tardos's codes. For example, when c = 8, our code length is about 4.94% of Tardos's code in a practical setting and about 4.62% in a certain limit case. Our code lengths for large c are asymptotically about 5.35% of Tardos's codes.

ジャーナルDesigns, Codes, and Cryptography
出版ステータス出版済み - 9 2009

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Applied Mathematics

フィンガープリント 「An improvement of discrete Tardos fingerprinting codes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。