Binary fingerprinting codes

DOI10.1007/S10623-003-1163-5MaRDI QIDQ2486878zbMATH OpenOpenAlexFDO

Authors J. Löfvenberg

Publication date 17 August 2005

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-003-1163-5

zbMATH Keywords

frameproof codesidentifiable parent property codeswatermarking

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Other types of codes (94B60) Bounds on codes (94B65)

Review text

Fingerprinting is the process whereby codewords from a code \(C\) are embedded into otherwise identical digital objects, thus making them unique. These objects are distributed among a number of users. Users working together to create illegal copies are assumed to be unable to create any changes in the objects, other than in places where the objects differ. Such users, called pirates, can construct a new object, but if there are at most \(c\) pirates, a \(c\)-IPP (identifiable parent property) code allows the distributor to trace at least one of the pirates taking part in constructing it. However, to be able to construct a \(c\)-IPP code requires that the alphabet size, \(q\), be strictly greater than the maximum number of pirates, \(c\). For cases where this is not possible, fingerprinting codes with an alphabet size not greater than the maximum number of pirates (\(q \leq c\)), must be employed. This paper considers the case \(q=c=2\). Three binary fingerprinting code classes with properties similar to codes with the identifiable parent property are proposed. In order to compare such codes a new combinatorial quality measure is introduced. In the case of two cooperating pirates, the measure is derived for the proposed codes, upper and lower bounds are constructed and the results of a computer search for good codes according to the quality measure are presented. Some properties of the quality measure are also derived.

Recommendations

• Equal-Weight Fingerprinting Codes
• Optimal probabilistic fingerprint codes
• scientific article; zbMATH DE number 1759652
• Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
• scientific article; zbMATH DE number 7051201

Cites work

• A class of traceability codes
• A hypergraph approach to the identifying parent property: The case of multiple parents
• Collusion-secure fingerprinting for digital data
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• scientific article; zbMATH DE number 1030976 (Why is no real title available?)
• More on (2,2)-separating systems
• On codes with the identifiable parent property
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures

Cited in

(7)

• Multimedia IPP codes with efficient tracing
• Codes for copyright protection: the case of two pirates
• Several new frameproof codes and secure frameproof codes
• scientific article; zbMATH DE number 1941260 (Why is no real title available?)
• scientific article; zbMATH DE number 1955790 (Why is no real title available?)
• scientific article; zbMATH DE number 2080172 (Why is no real title available?)
• Equal-Weight Fingerprinting Codes

This page was built for publication: Binary fingerprinting codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486878)