On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting

Abstract

Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia information. AND anti-collusion codes can be used to construct fingerprints resistant to collusion attacks on multimedia contents. In this paper, we first investigate AND anti-collusion codes and related detection algorithms from a combinatorial viewpoint, and then introduce a new concept of logical anti-collusion code to improve the traceability of multimedia fingerprinting. It reveals that frameproof codes have traceability for multimedia contents. Relationships among anti-collusion codes and other structures related to fingerprinting are discussed, and constructions for both AND anti-collusion codes and logical anti-collusion codes are provided.

New bounds on $$\bar{2}$$ 2 ¯ -separable codes of length 2

“…The study of separable codes is motivated by questions about multimedia fingerprinting which can effectively trace and even identify the sources of pirate copies of copyrighted multimedia data, see, e.g., [6,19]. It is not difficult to see [6] that identifiable parent property codes [15,24], frameproof codes [2,4], perfect hash families [20,25] and some other structures in digital fingerprinting all imply separable codes.…”

“…It is not difficult to see [6] that identifiable parent property codes [15,24], frameproof codes [2,4], perfect hash families [20,25] and some other structures in digital fingerprinting all imply separable codes.…”

“…Since the size M of t-SC(n, M, q) corresponds to the number of fingerprints assigned to authorized users, we should try to construct separable codes with size M as large as possible, given length n. Cheng and Miao [6] showed that long-length separable codes can be constructed by concatenating short-length separable codes. This stimulates the investigation of separable codes with length n = 2.…”

Bounds and constructions for $${\overline{3}}$$ 3 ¯ -separable codes with length 3

“…Separable codes can be used to construct multimedia fingerprinting codes which can effectively trace and even identify the sources of pirate copies of copyrighted multimedia data, see, e.g., [8,13]. They are of interest in combinatorics and can be also used to study the classic digital fingerprinting codes such as identifiable parent property (IPP) codes [9,10], frameproof codes (FPCs) [2,5], perfect hash families (PHFs) [11] and so on.…”

“…They are of interest in combinatorics and can be also used to study the classic digital fingerprinting codes such as identifiable parent property (IPP) codes [9,10], frameproof codes (FPCs) [2,5], perfect hash families (PHFs) [11] and so on. Cheng and Miao [8] pointed out that IPP codes, FPCs, PHFs and some other structures in digital fingerprinting are in fact examples of separable codes with additional properties.…”