Riding the saddle point: asymptotics of the capacity-achieving simple decoder for bias-based traitor tracing

Sarah Ibrahimi, Boris Škorić, Jan Jaap Oosterwijk

Research output: Contribution to journalArticleAcademicpeer-review

10 Citations (Scopus)
143 Downloads (Pure)


We study the asymptotic-capacity-achieving score function that was recently proposed by Oosterwijk et al. for bias-based traitor tracing codes. For the bias function, we choose the Dirichlet distribution with a cutoff. Using Bernstein’s inequality and Bennett’s inequality, we upper bound the false-positive and false-negative error probabilities. From these bounds we derive sufficient conditions for the scheme parameters. We solve these conditions in the limit of large coalition size c0 and obtain asymptotic solutions for the cutoff, the sufficient code length, and the corresponding accusation threshold. We find that the code length converges to its asymptote approximately as c0 −1/2, which is faster than the c0 −1/3 of Tardos’ score function. MSC:94B60

Original languageEnglish
Article number12
Number of pages18
JournalEURASIP Journal on Information Security
Issue number1
Publication statusPublished - 1 Dec 2014


  • Fingerprinting
  • Traitor tracing

Cite this