Multimedia IPP codes with efficient tracing
Tóm tắt
Wu et al. (IEEE Signal Process Mag 21:15–27, 2004) showed that fingerprinting system can be designed according to different criteria: catching one, catching many and catching all. For the case of “catching many”, binary multimedia identifiable parent property codes (t-MIPPCs) were introduced to construct fingerprints resistant to the averaging collusion attack on multimedia contents. In this paper, we focus on such a case, and introduce the binary strongly multimedia identifiable parent property code (t-SMIPPC) whose tracing algorithm is more efficient than that of a binary t-MIPPC. Then a concatenation construction for binary t-SMIPPCs from q-ary t-SMIPPCs is provided. Moreover, we establish a probabilistic lower bound on q-ary t-SMIPPCs, whose code rate is asymptotically as good as that of q-ary t-MIPPCs. Finally, several infinite series of optimal q-ary t-SMIPPCs of length 2 with $$t = 2, 3$$ are derived from the relationships among t-SMIPPCs and other fingerprinting codes, such as t-MIPPCs and $$\overline{t}$$-separable codes.
Tài liệu tham khảo
Barg A., Kabatiansky G.: A class of I.P.P. codes with efficient identification. J. Complex. 20, 137–147 (2004).
Barg A., Cohen G., Encheva S., Kabatiansky G., Zémor G.: A hypergraph approach to the identifying parent property: the case of multiple parents. SIAM J. Discret. Math. 14, 423–431 (2001).
Barg A., Blakley G.R., Kabatiansky G.: Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49, 852–865 (2003).
Blackburn S.R.: An upper bound on the size of a code with the \(k\)-identifiable property. J. Comb. Theory Ser. A 102, 179–185 (2003).
Blackburn S.R.: Probabilistic existence results for separable codes. IEEE Trans. Inf. Theory 61, 5822–5827 (2015).
Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44, 1897–1905 (1998).
Cheng M., Miao Y.: On anti-collusion codes and detection algorithms for multimedia fingerprinting. IEEE Trans. Inf. Theory 57, 4843–4851 (2011).
Cheng M., Ji L., Miao Y.: Separable codes. IEEE Trans. Inf. Theory 58, 1791–1803 (2012).
Cheng M., Fu H.-L., Jiang J., Lo Y.-H., Miao Y.: Codes with the identifiable parent property for multimedia fingerprinting. Des. Codes Cryptogr. 74, 31–40 (2015).
Cheng M., Fu H.-L., Jiang J., Lo Y.-H., Miao Y.: New bounds on \(\overline{2}\)-separable codes of length 2. Des. Codes Cryptogr. 83, 71–82 (2017).
Egorova E., Fernandez M., Kabatiansky G., Lee M.H.: Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing. Des. Codes Cryptogr. 87, 455–462 (2019).
Gao F., Ge G.: New bounds on separable codes for multimedia fingerprinting. IEEE Trans. Inf. Theory 60, 5257–5262 (2014).
Gu Y., Cheng M., Kabatiansky G., Miao Y.: Probabilistic existence results for parent-identifying schemes. IEEE Trans. Inf. Theory 65, 6160–6170 (2019).
Hollmann H.D.L., van Lint J.H., Linnartz J.-P., Tolhuizen L.M.G.M.: On codes with the identifiable parent property. J. Comb. Theory Ser. A 82, 121–133 (1998).
Jiang J., Cheng M., Miao Y.: Strongly separable codes. Des. Codes Cryptogr. 79, 303–318 (2016).
Liu K.J.R., Trappe W., Wang Z.J., Wu M., Zhao H.: Multimedia Fingerprinting Forensics for Traitor Tracing. Hindawi, New York (2005).
Shangguan C., Ma J., Ge G.: New upper bounds for parent-identifying codes and traceability codes. Des. Codes Cryptogr. 86, 1727–1737 (2018).
Staddon J.N., Stinson D.R., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47, 1042–1049 (2001).
Trappe W., Wu M., Wang Z.J., Liu K.J.R.: Anti-collusion fingerprinting for multimedia. IEEE Trans. Signal Process. 51, 1069–1087 (2003).
van Trung T., Martirosyan S.: New constructions for IPP codes. Des. Codes Cryptogr. 35, 227–239 (2005).
Wu M., Trappe W., Wang Z.J., Liu K.J.R.: Collusion-resistant fingerprinting for multimedia. IEEE Signal Process. Mag. 21, 15–27 (2004).