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

Koji Nuida, Manabu Hagiwara, Hajime Watanabe, Hideki Imai

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

24 被引用数 (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.

本文言語英語
ホスト出版物のタイトルInformation Hiding - 9th International Workshop, IH 2007, Revised Selected Papers
ページ279-293
ページ数15
DOI
出版ステータス出版済み - 2007
外部発表はい
イベント9th International Workshop on Information Hiding, IH 2007 - Saint Malo, フランス
継続期間: 6月 11 20076月 13 2007

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4567 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

会議

会議9th International Workshop on Information Hiding, IH 2007
国/地域フランス
CitySaint Malo
Period6/11/076/13/07

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータサイエンス一般

フィンガープリント

「Optimization of tardos's fingerprinting codes in a viewpoint of memory amount」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル