Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Designs, Codes and Cryptography
Published in: Designs, Codes and Cryptography 5/2020

24-01-2020

Multimedia IPP codes with efficient tracing

Authors: Jing Jiang, Yujie Gu, Minquan Cheng

Published in: Designs, Codes and Cryptography | Issue 5/2020

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

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.
previous article On equivalence of maximum additive symmetric rank-distance codes
next article Full classification of permutation rational functions and complete rational functions of degree three over finite fields
Literature
1.
2.
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).MathSciNetCrossRef
3.
Barg A., Blakley G.R., Kabatiansky G.: Digital fingerprinting codes: problem statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49, 852–865 (2003).MathSciNetCrossRef
4.
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).MathSciNetCrossRef
5.
Blackburn S.R.: Probabilistic existence results for separable codes. IEEE Trans. Inf. Theory 61, 5822–5827 (2015).MathSciNetCrossRef
6.
Boneh D., Shaw J.: Collusion-secure fingerprinting for digital data. IEEE Trans. Inf. Theory 44, 1897–1905 (1998).MathSciNetCrossRef
7.
Cheng M., Miao Y.: On anti-collusion codes and detection algorithms for multimedia fingerprinting. IEEE Trans. Inf. Theory 57, 4843–4851 (2011).MathSciNetCrossRef
8.
9.
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).MathSciNetCrossRef
10.
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).MathSciNetCrossRef
11.
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).MathSciNetCrossRef
12.
Gao F., Ge G.: New bounds on separable codes for multimedia fingerprinting. IEEE Trans. Inf. Theory 60, 5257–5262 (2014).MathSciNetCrossRef
13.
Gu Y., Cheng M., Kabatiansky G., Miao Y.: Probabilistic existence results for parent-identifying schemes. IEEE Trans. Inf. Theory 65, 6160–6170 (2019).MathSciNetCrossRef
14.
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).MathSciNetCrossRef
15.
16.
Liu K.J.R., Trappe W., Wang Z.J., Wu M., Zhao H.: Multimedia Fingerprinting Forensics for Traitor Tracing. Hindawi, New York (2005).CrossRef
17.
Shangguan C., Ma J., Ge G.: New upper bounds for parent-identifying codes and traceability codes. Des. Codes Cryptogr. 86, 1727–1737 (2018).MathSciNetCrossRef
18.
Staddon J.N., Stinson D.R., Wei R.: Combinatorial properties of frameproof and traceability codes. IEEE Trans. Inf. Theory 47, 1042–1049 (2001).MathSciNetCrossRef
19.
Trappe W., Wu M., Wang Z.J., Liu K.J.R.: Anti-collusion fingerprinting for multimedia. IEEE Trans. Signal Process. 51, 1069–1087 (2003).MathSciNetCrossRef
20.
21.
Wu M., Trappe W., Wang Z.J., Liu K.J.R.: Collusion-resistant fingerprinting for multimedia. IEEE Signal Process. Mag. 21, 15–27 (2004).
Metadata
Title
Multimedia IPP codes with efficient tracing
Authors
Jing Jiang
Yujie Gu
Minquan Cheng
Publication date
24-01-2020
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 5/2020
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-020-00717-y

Other articles of this Issue 5/2020

Designs, Codes and Cryptography 5/2020 Go to the issue

OriginalPaper

Do non-free LCD codes over finite commutative Frobenius rings exist?

OriginalPaper

Flag-transitive block designs with prime replication number and almost simple groups

OriginalPaper

On the smoothing parameter and last minimum of random orthogonal lattices

OriginalPaper

2-(v, 5; m) spontaneous emission error designs

OriginalPaper

On equivalence of maximum additive symmetric rank-distance codes

OriginalPaper

Improved (semi-free-start/near-) collision and distinguishing attacks on round-reduced RIPEMD-160

Premium Partner

    Image Credits