论文标题
平行内容通道的串谋指纹识别
Collusion-resistant fingerprinting of parallel content channels
论文作者
论文摘要
当示踪剂已知联盟尺寸$ k $时，对指纹游戏进行了分析，但是颜色可以在$ L $ $ $电视频道上分发自己。引入了勾结渠道，并在我们的制定中表现出了联盟的额外自由度。我们引入了类似于单电视频道案例的回报功能，并猜想与指纹容量密切相关。对于标记假设下的二进制字母案例，以及每个人每个段访问一个电视通道的限制，我们得出了回报功能的渐近行为。我们发现，最大值游戏对我们的回报的价值渐近地等于$ l^2/k^2 2 \ ln 2 $，具有最佳的示踪剂策略是Arcsine的分布，并且联盟是所有电视频道中的相互交织的攻击，并且在整个$ L $ l $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $中分配了相等数量。
The fingerprinting game is analysed when the coalition size $k$ is known to the tracer, but the colluders can distribute themselves across $L$ TV channels. The collusion channel is introduced and the extra degrees of freedom for the coalition are made manifest in our formulation. We introduce a payoff functional that is analogous to the single TV channel case, and is conjectured to be closely related to the fingerprinting capacity. For the binary alphabet case under the marking assumption, and the restriction of access to one TV channel per person per segment, we derive the asymptotic behavior of the payoff functional. We find that the value of the maximin game for our payoff is asymptotically equal to $L^2/k^2 2 \ln 2$, with optimal strategy for the tracer being the arcsine distribution, and for the coalition being the interleaving attack across all TV channels, as well as assigning an equal number of colluders across the $L$ TV channels.
