Anti-Collusion Digital Fingerprinting Codes via Partially Cover-Free Families

PSUM:Peer-to-peer multimedia content distribution using collusion-resistant fingerprinting

The use of peer-to-peer (P2P) networks for multimedia distribution has spread out globally in recent years. The mass popularity is primarily driven by cost-effective distribution of content, also giving rise to piracy. An end user (buyer/peer) of a P2P content distribution system does not want to reveal his/her identity during a transaction with a content owner (merchant), whereas the merchant does not want the buyer to further distribute the content illegally. To date, different P2P distribution systems have been proposed that provide copyright and privacy protection at a cost of high computa…

图像扩散模型的高效、鲁棒且抗共谋指纹识别

Efficient, Robust, and Anti-Collusion Fingerprinting of Image Diffusion Models

针对生成式文本到图像模型指纹识别缺乏抗共谋攻击鲁棒性的问题，提出基于个性化归一化模块的编码方法，并引入无损函数不变参数变换的抗共谋机制，实现高保真、高鲁棒且首次主动抵御共谋攻击的指纹识别。

An Asymmetric Fingerprinting Scheme based on Tardos Codes

Tardos codes are currently the state-of-the-art in the design of practical collusion-resistant fingerprinting codes. Tardos codes rely on a secret vector drawn from a publicly known probability distribution in order to generate each Buyer's fingerprint. For security purposes, this secret vector must not be revealed to the Buyers. To prevent an untrustworthy Provider forging a copy of a Work with an innocent Buyer's fingerprint, previous asymmetric fingerprinting algorithms enforce the idea of the Buyers generating their own fingerprint. Applying this concept to Tardos codes is challenging sinc…

Fingerprinting with Minimum Distance Decoding

This work adopts an information theoretic framework for the design of collusion-resistant coding/decoding schemes for digital fingerprinting. More specifically, the minimum distance decision rule is used to identify 1 out of t pirates. Achievable rates, under this detection rule, are characterized in two distinct scenarios. First, we consider the averaging attack where a random coding argument is used to show that the rate 1/2 is achievable with t=2 pirates. Our study is then extended to the general case of arbitrary $t$ highlighting the underlying complexity-performance tradeoff. Overall, the…

DeepMarks: A Digital Fingerprinting Framework for Deep Neural Networks

This paper proposes DeepMarks, a novel end-to-end framework for systematic fingerprinting in the context of Deep Learning (DL). Remarkable progress has been made in the area of deep learning. Sharing the trained DL models has become a trend that is ubiquitous in various fields ranging from biomedical diagnosis to stock prediction. As the availability and popularity of pre-trained models are increasing, it is critical to protect the Intellectual Property (IP) of the model owner. DeepMarks introduces the first fingerprinting methodology that enables the model owner to embed unique fingerprints w…

Nearest neighbor decoding for Tardos fingerprinting codes

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 p…

Tardos fingerprinting is better than we thought

We review the fingerprinting scheme by Tardos and show that it has a much better performance than suggested by the proofs in Tardos' original paper. In particular, the length of the codewords can be significantly reduced. First we generalize the proofs of the false positive and false negative error probabilities with the following modifications: (1) we replace Tardos' hard-coded numbers by variables and (2) we allow for independently chosen false positive and false negative error rates. It turns out that all the collusion-resistance properties can still be proven when the code length is reduce…

面向二进制Tardos指纹码的联合译码

Towards joint decoding of binary Tardos fingerprinting codes

针对概率指纹码联合译码缺乏实用大规模实现的问题，本文提出一种利用边信息和复合信道通用线性译码器的迭代联合译码器，无需精确合谋假设且支持水印软输出扩展，实验性能优于现有最优译码器。

Secure Codes with List Decoding

In this paper we consider combinatorial secure codes in traitor tracing for protecting copyright of multimedia content. First, we introduce a new notion of secure codes with list decoding (SCLDs) for collusion-resistant multimedia fingerprinting, which includes many existing types of fingerprinting codes as special cases. Next, we build efficient identifying algorithms for SCLDs with complete traceability and establish bounds on its largest possible code rate. In comparison with the existing fingerprinting codes, it is shown that SCLDs have not only much more efficient traceability than separa…

Tardos指纹码中内存使用的优化

Optimization of Memory Usage in Tardos's Fingerprinting Codes

本文针对Tardos指纹码内存占用大的问题，提出使用最优有限概率分布，将额外内存降至1/32甚至消除，码长减至约20.6%，并处理了近似误差等实际问题。

Upper Bounds on the Number of Codewords of Some Separating Codes

Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study upper bounds for separating codes. First, some new upper bound for restricted separating codes is proposed. Then we illustrate that the Upper Bound Conjecture for separating Reed-Solomon codes inherited from Silverberg's question holds true for almost all Reed-Solomon codes.

微波炉中的智能手机：对 Corona-Warn-App 进行指纹识别的形式化与实验可行性研究

Smartphones in a Microwave: Formal and Experimental Feasibility Study on Fingerprinting the Corona-Warn-App

本文通过实测发现德国 Corona-Warn-App 的蓝牙广播存在设备特定时序延迟，提出并验证了利用该差异被动指纹识别智能手机、进而追踪用户轨迹的可行性。