Tardos’s Fingerprinting Code over AWGN Channel

  • Minoru Kuribayashi
Conference paper

DOI: 10.1007/978-3-642-16435-4_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6387)
Cite this paper as:
Kuribayashi M. (2010) Tardos’s Fingerprinting Code over AWGN Channel. In: Böhme R., Fong P.W.L., Safavi-Naini R. (eds) Information Hiding. IH 2010. Lecture Notes in Computer Science, vol 6387. Springer, Berlin, Heidelberg


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 \(\breve{\rm S}\)kori\(\acute{\rm c}\) 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Minoru Kuribayashi
    • 1
  1. 1.Graduate School of EngineeringKobe UniversityHyogoJapan

Personalised recommendations