Randomized Frameproof Codes：指纹识别加验证减跟踪
Randomized Frameproof Codes: Fingerprinting Plus Validation Minus Tracing
摘要：
我们提出了随机防帧代码的内容保护，这是通过研究Boneh-Shaw指纹问题的变化。在修改后的系统中，每当用户试图访问他的指纹副本时，指纹都会被提交给验证算法，以在内容可以被执行之前验证它确实是允许的。与确定性防帧码和传统的指纹编码相比，我们在可实现的速率上有所改进。对于任意固定大小的联盟，我们构造随机化的防帧码，其具有$O(n^2)$复杂性验证算法和错误概率$\exp(-Ω(n)),$，其中$n$表示指纹的长度。最后，我们提出了线性防帧码和最小向量大小为2联盟之间的连接。
英文摘要：
We propose randomized frameproof codes for content protection, which arise by studying a variation of the Boneh-Shaw fingerprinting problem. In the modified system, whenever a user tries to access his fingerprinted copy, the fingerprint is submitted to a validation algorithm to verify that it is indeed permissible before the content can be executed. We show an improvement in the achievable rates compared to deterministic frameproof codes and traditional fingerprinting codes. For coalitions of an arbitrary fixed size, we construct randomized frameproof codes which have an $O(n^2)$ complexity validation algorithm and probability of error $\exp(-Ω(n)),$ where $n$ denotes the length of the fingerprints. Finally, we present a connection between linear frameproof codes and minimal vectors for size-2 coalitions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
