Tardos指纹码的最近邻译码
Nearest neighbor decoding for Tardos fingerprinting codes
摘要：
在过去的十年中，已经对Tardos的抗共谋指纹方案进行了各种改进[Tardos，STOC 2003]，最终使人们很好地理解了实现抗共谋所需的最小代码长度。相比之下，降低用于识别潜在共谋者的实际解码算法的成本受到的关注较少，即使先前的结果已经表明，使用被认为对于解码来说太昂贵的联合解码策略可能会导致更好的代码长度。此外，在动态设置中，可能需要快速解码器来实时提供答案，这进一步提出了是否可以利用更智能的解码算法来降低基于分数的指纹识别方案的解码成本的问题。在本文中，我们将展示如何建模的解码步骤的分数为基础的指纹作为一个最近邻搜索问题，以及这种关系如何使我们能够应用技术从该领域的（近似）最近邻搜索，以获得解码时间是次线性的用户总数。由于这不影响编码和嵌入步骤，因此这种解码机制可以容易地部署在现有的指纹识别方案中，并且这可以使真正有效的联合解码器更接近现实。除了应用于指纹识别之外，类似的技术可以用于降低组测试方法的解码成本，这可能是独立感兴趣的。
英文摘要：
Over the past decade, various improvements have been made to Tardos' collusion-resistant fingerprinting scheme [Tardos, STOC 2003], ultimately resulting in a good understanding of what is the minimum code length required to achieve collusion-resistance. In contrast, decreasing the cost of the actual decoding algorithm for identifying the potential colluders has received less attention, even though previous results have shown that using joint decoding strategies, deemed too expensive for decoding, may lead to better code lengths. Moreover, in dynamic settings a fast decoder may be required to provide answers in real-time, further raising the question whether the decoding costs of score-based fingerprinting schemes can be decreased with a smarter decoding algorithm. In this paper we show how to model the decoding step of score-based fingerprinting as a nearest neighbor search problem, and how this relation allows us to apply techniques from the field of (approximate) nearest neighbor searching to obtain decoding times which are sublinear in the total number of users. As this does not affect the encoding and embedding steps, this decoding mechanism can easily be deployed within existing fingerprinting schemes, and this may bring a truly efficient joint decoder closer to reality. Besides the application to fingerprinting, similar techniques can be used to decrease the decoding costs of group testing methods, which may be of independent interest.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
