82 research outputs found
Improved Constructions of Frameproof Codes
Frameproof codes are used to preserve the security in the context of
coalition when fingerprinting digital data. Let be the largest
cardinality of a -ary -frameproof code of length and
. It has
been determined by Blackburn that when ,
when and is even, and . In this paper, we
give a recursive construction for -frameproof codes of length with
respect to the alphabet size . As applications of this construction, we
establish the existence results for -ary -frameproof codes of length
and size for all odd when and for all
when . Furthermore, we show that
meeting the upper bound given by Blackburn, for all integers such that
is a prime power.Comment: 6 pages, to appear in Information Theory, IEEE Transactions o
Comment on "New Results on Frame-Proof Codes and Traceability Schemes"
In the paper "New Results on Frame-Proof Codes and Traceability Schemes" by
Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no.
7, pp. 3029-3033, Nov. 2001], there are lower bounds for the maximal number of
codewords in binary frame-proof codes and decoders in traceability schemes.
There are also existence proofs using a construction of binary frame-proof
codes and traceability schemes. Here it is found that the main results in the
referenced paper do not hold.Comment: 3 page
On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
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
Gossip Codes for Fingerprinting: Construction, Erasure Analysis and Pirate Tracing
This work presents two new construction techniques for q-ary Gossip codes
from tdesigns and Traceability schemes. These Gossip codes achieve the shortest
code length specified in terms of code parameters and can withstand erasures in
digital fingerprinting applications. This work presents the construction of
embedded Gossip codes for extending an existing Gossip code into a bigger code.
It discusses the construction of concatenated codes and realisation of erasure
model through concatenated codes.Comment: 28 page
- …