Multimedia IPP Codes with Efficient Tracing

DOI10.1007/S10623-020-00717-YMaRDI QIDQ6256722arXivWikidataFDO

Authors Jing Jiang, Yujie Gu, Minquan Cheng

Publication date 25 November 2014

Published in arXiv

Full work available at URL https://doi.org/10.1007/S10623-020-00717-Y

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Combinatorial codes (94B25)

arXiv classification

cs.ITmath.IT

Abstract: Binary multimedia identifiable parent property codes (binary $t$-MIPPCs) are used in multimedia fingerprinting schemes where the identification of users taking part in the averaging collusion attack to illegally redistribute content is required. In this paper, we first introduce a binary strong multimedia identifiable parent property code (binary $t$-SMIPPC) whose tracing algorithm is more efficient than that of a binary $t$-MIPPC. Then a composition construction for binary $t$-SMIPPCs from $q$-ary $t$-SMIPPCs is provided. 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 $overlinet$-separable codes and $t$-MIPPCs. Finally, combinatorial properties of $q$-ary $2$-SMIPPCs of length $3$ are investigated, and optimal $q$-ary $2$-SMIPPCs of length $3$ with $qequiv0,1,2,5pmod6$ are constructed.

This page was built for publication: Multimedia IPP Codes with Efficient Tracing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6256722)