最优对称Tardos叛逆者追踪方案
Optimal symmetric Tardos traitor tracing schemes
摘要：
对于Tardos叛逆者追踪方案，我们证明了将Skoric等人的符号对称指控函数与Blayer和Tassa的改进分析相结合，我们得到了进一步的改进。我们的建设给出的代码是4倍短于Blayer和Tassa的，和2倍短于代码从Skoric等人。渐近地，我们实现了理论上的最佳codelength为Tardos的分布函数和对称得分函数。对于大联盟，我们的codelectin渐近约4.93%的Tardos的原始codelectin，这也提高了从Nuida等人的结果。
英文摘要：
For the Tardos traitor tracing scheme, we show that by combining the symbol-symmetric accusation function of Skoric et al. with the improved analysis of Blayer and Tassa we get further improvements. Our construction gives codes that are up to 4 times shorter than Blayer and Tassa's, and up to 2 times shorter than the codes from Skoric et al. Asymptotically, we achieve the theoretical optimal codelength for Tardos' distribution function and the symmetric score function. For large coalitions, our codelengths are asymptotically about 4.93% of Tardos' original codelengths, which also improves upon results from Nuida et al.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
