Combinatorial properties of frameproof and traceability codes
Combinatorial properties of frameproof and traceability codes
复制标题
DOI：
10.1109/18.915661
复制
发表时间：
2001-03
期刊：
影响因子：
--
通讯作者：
J. Staddon;Douglas R Stinson;R. Wei
中科院分区：
文献类型：
--
作者：
J. Staddon;Douglas R Stinson;R. Wei
为了保护受版权保护的材料，可以将代码嵌入到内容中或者可以将代码与用于恢复内容的密钥相关联。代码可以通过为盗版数据提供某种形式的可追溯性 (TA) 来提供保护。前几年，一些研究人员研究了 TA 的不同概念和相关概念。 TA 的“强”版本允许追踪构建“盗版解码器”的联盟中的至少一名成员。这个概念的较弱版本确保没有联盟可以“框架”不相交的用户或用户组。所有这些概念都可以表述为具有某些组合属性的代码。我们研究各种概念之间的关系，并讨论使用完美哈希族等结构的等效公式。我们使用组合学和编码理论的方法来为感兴趣的对象提供边界（必要条件）和构造（充分条件）。
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 (TA) for pirated data. Several researchers have studied different notions of TA and related concepts in previous years. "Strong" versions of TA 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. 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.