Welcome to the resource topic for 2013/809
Title:
Riding the Saddle Point: asymptotics of the capacity-achieving simple decoder for bias-based traitor tracing
Authors: Sarah Ibrahimi, Boris Skoric, Jan-Jaap Oosterwijk
Abstract: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 c_0 and obtain asymptotic solutions for the cutoff, the sufficient code length and the corresponding accusation threshold. The code length converges to its asymptote approximately as c_0^{-1/2}, which is faster than the c_0^{-1/3} of Tardos’ score function.
ePrint: https://eprint.iacr.org/2013/809
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .