Blind Fingerprinting
Blind Fingerprinting
复制标题
盲指纹识别
DOI：
--
复制
发表时间：
2008
期刊：
影响因子：
--
通讯作者：
P. Moulin
中科院分区：
文献类型：
--
作者：
Y. Wang;P. Moulin
我们研究盲指纹，其中嵌入指纹的宿主序列对解码器是部分或完全未知的。这个问题与Gel'fand-Pinsker问题的多用户版本有关。合谋者的数目和合谋通道是未知的，合谋者和指纹嵌入器受到失真约束。本文提出了一种条件常数合成随机绑定方案和一种通用的译码规则，并推导出相应的假阳性和假阴性误差指数。该编码器是一个堆叠装箱计划，并利用一个辅助随机序列。该解码器是一个最大的双重惩罚的互信息解码器，其中每个候选联盟的重要性是相对于一个阈值，权衡假阳性和假阴性的错误指数进行评估。惩罚与联盟大小成正比，并且是宿主序列的条件类型的函数。在低于某个值的所有速率下都获得正指数，因此这是公共指纹识别能力的下限。我们推测这个瓦尔值就是公共指纹容量。文中还给出了一种简单的门限译码器，它具有相似的普适性，但可达速率较低。公共指纹容量的上限也被推导出来。
We study blind fingerprinting, where the host sequence into w hich fingerprints are embedded is partially or completely unknown to the decoder. This proble m relates to a multiuser version of the Gel’fand-Pinsker problem. The number of colluders and the c ollusion channel are unknown, and the colluders and the fingerprint embedder are subject to distor tion constraints. We propose a conditionally constant-composition random bi nning scheme and a universal decoding rule and derive the corresponding false-positive and false -negative error exponents. The encoder is a stacked binning scheme and makes use of an auxiliary random s equence. The decoder is a maximum doubly-penalized mutual information decoder , where the significance of each candidate coalition is assessed relative to a threshold that trades off false-posi tive and false-negative error exponents. The penalty is proportional to coalition size and is a function o f the conditional type of host sequence. Positive exponents are obtained at all rates below a certain value, which is therefore a lower bound on public fingerprinting capacity. We conjecture that this val ue is the public fingerprinting capacity. A simpler threshold decoder is also given, which has similar universa lity properties but also lower achievable rates. An upper bound on public fingerprinting capacity is also deri ved.