Tardos's fingerprinting code over AWGN channel

Minoru Kuribayashi

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

13 Citations (Scopus)


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
Number of pages15
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)0302-9743
ISSN (Electronic)1611-3349


Other12th International Conference on Information Hiding, IH 2010
CityCalgary, AB

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Tardos's fingerprinting code over AWGN channel'. Together they form a unique fingerprint.

Cite this