Tardos's fingerprinting code over AWGN channel

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

11 Citations (Scopus)

Abstract

Binary fingerprinting codes with a length of theoretically minimum order were proposed by Tardos, and the traceability has been estimated under the well-known marking assumption. In this paper, we estimate the traceability and the false-positive probability of the fingerprinting code over AWGN channel, and propose a new accusation algorithm to catch more colluders with less innocent users. The design of our algorithm is based on the symmetric accusation algorithm proposed by kori et al. that focuses on the characteristic of the p.d.f. of the correlation scores. The proposed algorithm first estimates the strength of noise added to the code, and then calculates the specific correlation scores among candidate codewords using the characteristic of the noisy channel. The scores are finally classified into guilty and innocent by the threshold obtained from the p.d.f. The performance of the proposed tracing algorithm is evaluated by Monte Carlo simulation.

Original languageEnglish
Title of host publicationInformation Hiding - 12th International Conference, IH 2010, Revised Selected Papers
Pages103-117
Number of pages15
Volume6387 LNCS
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event12th International Conference on Information Hiding, IH 2010 - Calgary, AB, Canada
Duration: Jun 28 2010Jun 30 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6387 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other12th International Conference on Information Hiding, IH 2010
CountryCanada
CityCalgary, AB
Period6/28/106/30/10

Fingerprint

Fingerprinting
Traceability
Design of Algorithms
Tracing
False Positive
Binary codes
Estimate
Monte Carlo Simulation
Binary
Calculate

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Kuribayashi, M. (2010). Tardos's fingerprinting code over AWGN channel. In Information Hiding - 12th International Conference, IH 2010, Revised Selected Papers (Vol. 6387 LNCS, pp. 103-117). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6387 LNCS). https://doi.org/10.1007/978-3-642-16435-4_9

Tardos's fingerprinting code over AWGN channel. / Kuribayashi, Minoru.

Information Hiding - 12th International Conference, IH 2010, Revised Selected Papers. Vol. 6387 LNCS 2010. p. 103-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6387 LNCS).

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

Kuribayashi, M 2010, Tardos's fingerprinting code over AWGN channel. in Information Hiding - 12th International Conference, IH 2010, Revised Selected Papers. vol. 6387 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6387 LNCS, pp. 103-117, 12th International Conference on Information Hiding, IH 2010, Calgary, AB, Canada, 6/28/10. https://doi.org/10.1007/978-3-642-16435-4_9
Kuribayashi M. Tardos's fingerprinting code over AWGN channel. In Information Hiding - 12th International Conference, IH 2010, Revised Selected Papers. Vol. 6387 LNCS. 2010. p. 103-117. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-16435-4_9
Kuribayashi, Minoru. / Tardos's fingerprinting code over AWGN channel. Information Hiding - 12th International Conference, IH 2010, Revised Selected Papers. Vol. 6387 LNCS 2010. pp. 103-117 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{06b4ab8e53d34833891f7b84a08c5205,
title = "Tardos's fingerprinting code over AWGN channel",
abstract = "Binary fingerprinting codes with a length of theoretically minimum order were proposed by Tardos, and the traceability has been estimated under the well-known marking assumption. In this paper, we estimate the traceability and the false-positive probability of the fingerprinting code over AWGN channel, and propose a new accusation algorithm to catch more colluders with less innocent users. The design of our algorithm is based on the symmetric accusation algorithm proposed by kori et al. that focuses on the characteristic of the p.d.f. of the correlation scores. The proposed algorithm first estimates the strength of noise added to the code, and then calculates the specific correlation scores among candidate codewords using the characteristic of the noisy channel. The scores are finally classified into guilty and innocent by the threshold obtained from the p.d.f. The performance of the proposed tracing algorithm is evaluated by Monte Carlo simulation.",
author = "Minoru Kuribayashi",
year = "2010",
doi = "10.1007/978-3-642-16435-4_9",
language = "English",
isbn = "364216434X",
volume = "6387 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "103--117",
booktitle = "Information Hiding - 12th International Conference, IH 2010, Revised Selected Papers",

}

TY - GEN

T1 - Tardos's fingerprinting code over AWGN channel

AU - Kuribayashi, Minoru

PY - 2010

Y1 - 2010

N2 - Binary fingerprinting codes with a length of theoretically minimum order were proposed by Tardos, and the traceability has been estimated under the well-known marking assumption. In this paper, we estimate the traceability and the false-positive probability of the fingerprinting code over AWGN channel, and propose a new accusation algorithm to catch more colluders with less innocent users. The design of our algorithm is based on the symmetric accusation algorithm proposed by kori et al. that focuses on the characteristic of the p.d.f. of the correlation scores. The proposed algorithm first estimates the strength of noise added to the code, and then calculates the specific correlation scores among candidate codewords using the characteristic of the noisy channel. The scores are finally classified into guilty and innocent by the threshold obtained from the p.d.f. The performance of the proposed tracing algorithm is evaluated by Monte Carlo simulation.

AB - Binary fingerprinting codes with a length of theoretically minimum order were proposed by Tardos, and the traceability has been estimated under the well-known marking assumption. In this paper, we estimate the traceability and the false-positive probability of the fingerprinting code over AWGN channel, and propose a new accusation algorithm to catch more colluders with less innocent users. The design of our algorithm is based on the symmetric accusation algorithm proposed by kori et al. that focuses on the characteristic of the p.d.f. of the correlation scores. The proposed algorithm first estimates the strength of noise added to the code, and then calculates the specific correlation scores among candidate codewords using the characteristic of the noisy channel. The scores are finally classified into guilty and innocent by the threshold obtained from the p.d.f. The performance of the proposed tracing algorithm is evaluated by Monte Carlo simulation.

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

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

U2 - 10.1007/978-3-642-16435-4_9

DO - 10.1007/978-3-642-16435-4_9

M3 - Conference contribution

SN - 364216434X

SN - 9783642164347

VL - 6387 LNCS

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

SP - 103

EP - 117

BT - Information Hiding - 12th International Conference, IH 2010, Revised Selected Papers

ER -