New Bounds on Separable Codes for Multimedia Fingerprinting

作者：Gao, Fei^*; Ge, Gennian

来源：IEEE Transactions on Information Theory, 2014, 60(9): 5257-5262.

DOI：10.1109/TIT.2014.2331989

• Frameproof codes
• probabilistic methods
• separable codes
• separating hash families
• Stein-Lovasz theorem

Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia contents. Separable codes were introduced to detect colluders taking part in the averaging attack, which is the most feasible approach to perform a collusion attack. In this paper, we provide some improved bounds for the size of separable codes. Using a combinatorial technique named grouping coordinates, we have greatly reduced the upper bound. On the other hand, we also provide some lower bounds for the size of separable codes by both probabilistic and deterministic construction methods. In particular, 2-separable codes with asymptotically optimal rate are obtained by the deletion method.

• 出版日期2014-9
• 单位浙江大学; 首都师范大学