版权保护中的组合安全码及相关问题

Combinatorial secure codes for copyright protection and related problems

现代科技的快速发展给数据传播和流通提供了便捷,同时也对数据内容的版权保护构成了巨大的威胁.本文聚焦版权保护中的对抗合谋攻击的数学理论及其最新研究进展.针对广播加密和多媒体指纹识别等不同场景的应用,本文提出可追踪分配方案和防诬陷分配方案的统一的数学模型.在此基础上,本文介绍具体的可追踪组合安全码和防诬陷组合安全码,以及关于它们的最大码字个数的上下界和具体构造等研究的组合方法、最新结果和公开问题.此外,本文也将介绍版权保护与群试理论和多用户通信领域相关组合问题的联系.

The rapid development of modern science and technology not only provides convenience for data communication, but also poses a tremendous threat to the copyright of digital content. This paper focuses on the mathematical theory of traitor-tracing for copyright protection and its latest progress. First, for applications in different scenarios, such as broadcast encryption and multimedia fingerprinting, we introduce unified models to characterize the(key/fingerprint) distribution schemes with traceability property and frameproof property,respectively. Next, we review several classes of combinatorial secure codes with the traceability property and frameproof property, and the combinatorial methods used to investigate the bounds on the maximum code size and the explicit constructions, as well as the latest results and the open problems. The relationships between the combinatorial problems in copyright protection and the related problems in group testing and multiple access communication are discussed as well.