Welcome to the resource topic for 2000/004
Title:
Combinatorial Properties of Frameproof and Traceability Codes
Authors: J. N. Staddon, D. R. Stinson, R. Wei
Abstract:In order to protect copyrighted material, codes may be
embedded in the content or codes may be associated with the
keys used to recover the content. Codes can offer protection
by providing some form of traceability for pirated
data. Several researchers have studied different notions of
traceability and related concepts in recent years. “Strong”
versions of traceability allow at least one member of a
coalition that constructs a “pirate decoder” to be
traced. Weaker versions of this concept ensure that no
coalition can “frame” a disjoint user or group of users. All
these concepts can be formulated as codes having certain
combinatorial properties.
In this paper, we study the relationships between the various
notions, and we discuss equivalent formulations using
structures such as perfect hash families. We use methods from
combinatorics and coding theory to provide bounds (necessary
conditions) and constructions (sufficient conditions) for the
objects of interest.
ePrint: https://eprint.iacr.org/2000/004
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .