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

Koji Nuida; Manabu Hagiwara; Hajime Watanabe; Hideki Imai

doi:10.1007/978-3-540-77370-2_19

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 proceeding › Conference contribution

23 Citations (Scopus)

Abstract

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 language	English
Title of host publication	Information Hiding - 9th International Workshop, IH 2007, Revised Selected Papers
Pages	279-293
Number of pages	15
DOIs	https://doi.org/10.1007/978-3-540-77370-2_19
Publication status	Published - 2007
Externally published	Yes
Event	9th International Workshop on Information Hiding, IH 2007 - Saint Malo, France Duration: Jun 11 2007 → Jun 13 2007

Publication series

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

Conference

Conference	9th International Workshop on Information Hiding, IH 2007
Country/Territory	France
City	Saint Malo
Period	6/11/07 → 6/13/07

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-540-77370-2_19

Cite this

Nuida, K., Hagiwara, M., Watanabe, H., & Imai, H. (2007). Optimization of tardos's fingerprinting codes in a viewpoint of memory amount. In Information Hiding - 9th International Workshop, IH 2007, Revised Selected Papers (pp. 279-293). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4567 LNCS). https://doi.org/10.1007/978-3-540-77370-2_19

Optimization of tardos's fingerprinting codes in a viewpoint of memory amount. / Nuida, Koji; Hagiwara, Manabu; Watanabe, Hajime et al.
Information Hiding - 9th International Workshop, IH 2007, Revised Selected Papers. 2007. p. 279-293 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4567 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nuida, K, Hagiwara, M, Watanabe, H & Imai, H 2007, Optimization of tardos's fingerprinting codes in a viewpoint of memory amount. in Information Hiding - 9th International Workshop, IH 2007, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4567 LNCS, pp. 279-293, 9th International Workshop on Information Hiding, IH 2007, Saint Malo, France, 6/11/07. https://doi.org/10.1007/978-3-540-77370-2_19

Nuida K, Hagiwara M, Watanabe H, Imai H. Optimization of tardos's fingerprinting codes in a viewpoint of memory amount. In Information Hiding - 9th International Workshop, IH 2007, Revised Selected Papers. 2007. p. 279-293. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-77370-2_19

Nuida, Koji ; Hagiwara, Manabu ; Watanabe, Hajime et al. / Optimization of tardos's fingerprinting codes in a viewpoint of memory amount. Information Hiding - 9th International Workshop, IH 2007, Revised Selected Papers. 2007. pp. 279-293 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{a2e596e4b0234bbfb5112120ecc9e486,

title = "Optimization of tardos's fingerprinting codes in a viewpoint of memory amount",

abstract = "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.",

author = "Koji Nuida and Manabu Hagiwara and Hajime Watanabe and Hideki Imai",

year = "2007",

doi = "10.1007/978-3-540-77370-2_19",

language = "English",

isbn = "354077369X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "279--293",

booktitle = "Information Hiding - 9th International Workshop, IH 2007, Revised Selected Papers",

note = "9th International Workshop on Information Hiding, IH 2007 ; Conference date: 11-06-2007 Through 13-06-2007",

}

TY - GEN

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

AU - Nuida, Koji

AU - Hagiwara, Manabu

AU - Watanabe, Hajime

AU - Imai, Hideki

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=49949086761&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49949086761&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-77370-2_19

DO - 10.1007/978-3-540-77370-2_19

M3 - Conference contribution

AN - SCOPUS:49949086761

SN - 354077369X

SN - 9783540773696

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 279

EP - 293

BT - Information Hiding - 9th International Workshop, IH 2007, Revised Selected Papers

T2 - 9th International Workshop on Information Hiding, IH 2007

Y2 - 11 June 2007 through 13 June 2007

ER -

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

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this