New Digital Fingerprint Code Construction Scheme Using Group-Divisible Design

Abstract

Combinatorial designs have been used to construct digital fingerprint codes. Here, a new constructive algorithm for an anticollusion fingerprint code based on group-divisible designs is presented. These codes are easy to construct and available for a large number of individuals, which is important from a business point of view. Group-divisible designs have not been used previously as a tool for fingerprint code construction.

Polynomial-Time Codes Against Averaging Attack for Multimedia Fingerprinting

“…Using AC codes given by (Kang et al, 2006) and (Li et al, 2009) as the inner codes, a similar result can be obtained. Based on list-decoding for the outer code, we proposed a polynomial-time decoding algorithm.…”

“…In the proposed concatenated coding, any AC codes can be used as the inner code. Using AC-codes given by (Kang et al, 2006) and (Li et al, 2009) as the inner codes, we obtain analogous results.…”

“…Subsequently, several studies have proposed a method for increasing coding rates of AC codes based on a various class of block designs and related methods. Some examples are based on group-divisible design (Kang et al, 2006), finite geometries and low-density matrices (Yagi et al, 2009), and cover-free families of sets (Li et al, 2009). In order to further increase the coding rate, concatenated coding in which an outer error correcting code is concatenated with an inner AC code, has been proposed (Yagi et al, 2007).…”

Fingerprinting Codes for Internet-Based Live Pay-TV System Using Balanced Incomplete Block Designs

“…In [14], a new constructive algorithm for binary ACC is presented based on GD-PBIBD (group-divisible partially balanced incomplete block design) theory, which is more efficient in designing fingerprinting code. Further, [15] also describes a method to embed and detect fingerprinting code derived from GD-PBIBDs.…”

“…k-anti-collusion code (ACC) [13], [14] k-anti-collusion code (ACC) has the property that the composition of any subset of k or fewer codewords is unique and therefore can identify groups of k or fewer colluders.…”