Tardos格式中的离散分布
Discrete Distributions in the Tardos Scheme, Revisited
摘要：
Tardos方案是一种著名的叛逆者追踪方案，用于保护受版权保护的内容免受共谋攻击。原始方案包含一些次优设计选择，例如用于产生偏差的评分函数和分布函数。Skoric等人先前表明，符号对称的得分函数导致更短的代码，而Nuida等人获得了任意联盟大小的最佳分布函数。后来，Nuida等人表明，当联盟规模较小时，将这些结果结合起来会导致更短的代码。我们将他们的分析扩展到大联盟的情况下，并证明这些最优分布收敛到反正弦分布，从而表明反正弦分布是渐近最优的对称Tardos计划。我们还提出了一个新的，实用的替代离散分布的Nuida等人。并给出了这些分布的指纹码的估计长度的比较。
英文摘要：
The Tardos scheme is a well-known traitor tracing scheme to protect copyrighted content against collusion attacks. The original scheme contained some suboptimal design choices, such as the score function and the distribution function used for generating the biases. Skoric et al. previously showed that a symbol-symmetric score function leads to shorter codes, while Nuida et al. obtained the optimal distribution functions for arbitrary coalition sizes. Later, Nuida et al. showed that combining these results leads to even shorter codes when the coalition size is small. We extend their analysis to the case of large coalitions and prove that these optimal distributions converge to the arcsine distribution, thus showing that the arcsine distribution is asymptotically optimal in the symmetric Tardos scheme. We also present a new, practical alternative to the discrete distributions of Nuida et al. and give a comparison of the estimated lengths of the fingerprinting codes for each of these distributions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
