TY - JOUR
T1 - Multimedia IPP codes with efficient tracing
AU - Jiang, Jing
AU - Gu, Yujie
AU - Cheng, Minquan
N1 - Funding Information:
The work of J. Jiang and M. Cheng was in part supported by NSFC (Nos. 11301098, 11601096, 11671103), 2016GXNSF (Nos. FA380011, CA380021), 2018GXNSFAA138152, Guangxi Higher Institutions Program of Introducing 100 High-Level Overseas Talents, Research Fund of Guangxi Key Lab of Multi-source Information Mining & Security (16-B-01,18-B-01), Guangxi Collaborative Innovation Center of Multi-source Information Integration and Intelligent Processing, and the Guangxi “Bagui Scholar” Teams for Innovation and Research Project.
Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2020/5/1
Y1 - 2020/5/1
N2 - 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 t¯ -separable codes.
AB - 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 t¯ -separable codes.
UR - http://www.scopus.com/inward/record.url?scp=85078151766&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078151766&partnerID=8YFLogxK
U2 - 10.1007/s10623-020-00717-y
DO - 10.1007/s10623-020-00717-y
M3 - Article
AN - SCOPUS:85078151766
VL - 88
SP - 851
EP - 866
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
SN - 0925-1022
IS - 5
ER -