Skip to main content
Erschienen in: Designs, Codes and Cryptography 2-3/2019

21.09.2018

Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing

verfasst von: Elena Egorova, Marcel Fernandez, Grigory Kabatiansky, Moon Ho Lee

Erschienen in: Designs, Codes and Cryptography | Ausgabe 2-3/2019

Einloggen, um Zugang zu erhalten

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

We propose a new approach to construct noise-resistant multimedia fingerprinting codes. Our approach is based on the theory of the signature codes for multiple access channels, mainly, for a weighted noisy adder channel. The corresponding multimedia fingerprinting codes allow to trace the entire coalition of pirates. The codes provide significantly better rate than previously known multimedia fingerprinting schemes. We establish the relationship between multimedia fingerprinting and compressed sensing problems.
Literatur
2.
Zurück zum Zitat Barg A., Blakley G.R., Kabatiansky G.: Digital fingerprinting codes: problems statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4), 852–865 (2003).MathSciNetCrossRefMATH Barg A., Blakley G.R., Kabatiansky G.: Digital fingerprinting codes: problems statements, constructions, identification of traitors. IEEE Trans. Inf. Theory 49(4), 852–865 (2003).MathSciNetCrossRefMATH
3.
4.
Zurück zum Zitat Candes E.J., Tao T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inf. Theory 52(4), 5406–5425 (2006).MathSciNetCrossRefMATH Candes E.J., Tao T.: Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inf. Theory 52(4), 5406–5425 (2006).MathSciNetCrossRefMATH
5.
Zurück zum Zitat Chang S.C., Wolf J.K.: On the T-user M-frequency noiseless multiple-access channel with and without intensity information. IEEE Trans. Inf. Theory 27(1), 41–48 (1981).MathSciNetCrossRefMATH Chang S.C., Wolf J.K.: On the T-user M-frequency noiseless multiple-access channel with and without intensity information. IEEE Trans. Inf. Theory 27(1), 41–48 (1981).MathSciNetCrossRefMATH
6.
Zurück zum Zitat Cheng M., Miao Y.: On anti-collusion codes and detection algrithms for multimedia fingerprinting. IEEE Trans. Inf. Theory 57(7), 4843–4851 (2011).CrossRefMATH Cheng M., Miao Y.: On anti-collusion codes and detection algrithms for multimedia fingerprinting. IEEE Trans. Inf. Theory 57(7), 4843–4851 (2011).CrossRefMATH
8.
Zurück zum Zitat Cheng M., Fu H.-L., Jiang J., Lo Y.-H., Miao Y.: New bounds on 2-separable codes of length 2. Des. Codes Cryptogr. 74(3), 31–40 (2015).MathSciNetCrossRefMATH Cheng M., Fu H.-L., Jiang J., Lo Y.-H., Miao Y.: New bounds on 2-separable codes of length 2. Des. Codes Cryptogr. 74(3), 31–40 (2015).MathSciNetCrossRefMATH
9.
Zurück zum Zitat Chor B., Fiat A., Naor M.: Tracing traitors. In: Desmedt Y.G. (ed.) Advances in Cryptology–Crypto’94, LNCS, vol. 839, pp. 480–491. Springer, New York (1994). Chor B., Fiat A., Naor M.: Tracing traitors. In: Desmedt Y.G. (ed.) Advances in Cryptology–Crypto’94, LNCS, vol. 839, pp. 480–491. Springer, New York (1994).
10.
Zurück zum Zitat Cohen G.D., Schaathun H.G.: Asymptotic overview on separating codes. Tech. Report 248, Department of Informatics, University of Bergen, Bergen, Norway (2003). Cohen G.D., Schaathun H.G.: Asymptotic overview on separating codes. Tech. Report 248, Department of Informatics, University of Bergen, Bergen, Norway (2003).
12.
Zurück zum Zitat Csros M., Ruszinko M.: Single-user tracing and disjointly superimposed codes. IEEE Trans. Inf. Theory 51(4), 1606–1611 (2005).MathSciNetCrossRefMATH Csros M., Ruszinko M.: Single-user tracing and disjointly superimposed codes. IEEE Trans. Inf. Theory 51(4), 1606–1611 (2005).MathSciNetCrossRefMATH
14.
Zurück zum Zitat Egorova E., Fernandez M., Kabatiansky G., Lee M.H.: Signature codes for A-channel and collusion-secure multimedia fingerprinting codes. In: Proceedings 2016 IEEE International Symposium on Information Theory, Barcelona, pp. 3043–3047 (2016). Egorova E., Fernandez M., Kabatiansky G., Lee M.H.: Signature codes for A-channel and collusion-secure multimedia fingerprinting codes. In: Proceedings 2016 IEEE International Symposium on Information Theory, Barcelona, pp. 3043–3047 (2016).
15.
Zurück zum Zitat Egorova E., Fernandez M., Kabatiansky G.: Multimedia fingerprinting codes resistant against colluders and noise. In: Proceedings of 8th IEEE International Workshop on Information Forensic and Security, Abu Dhabi, pp. 1–5 (2016). Egorova E., Fernandez M., Kabatiansky G.: Multimedia fingerprinting codes resistant against colluders and noise. In: Proceedings of 8th IEEE International Workshop on Information Forensic and Security, Abu Dhabi, pp. 1–5 (2016).
16.
17.
Zurück zum Zitat Gritsenko V., Kabatiansky G., Lebedev V., Maevskiy A.: Signature codes for noisy multiple access adder channel. Des. Codes Cryptogr. 82(1), 293–299 (2017).MathSciNetCrossRefMATH Gritsenko V., Kabatiansky G., Lebedev V., Maevskiy A.: Signature codes for noisy multiple access adder channel. Des. Codes Cryptogr. 82(1), 293–299 (2017).MathSciNetCrossRefMATH
18.
Zurück zum Zitat 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(2), 121–133 (1998).MathSciNetCrossRefMATH 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(2), 121–133 (1998).MathSciNetCrossRefMATH
20.
Zurück zum Zitat Kabatiansky G., Vladuts S., Tavernier C.: On the doubly sparse compressed sensing problem. In: Proceedings of IMAAC 2015, LNCS, vol. 9496, pp. 1–6 (2015). Kabatiansky G., Vladuts S., Tavernier C.: On the doubly sparse compressed sensing problem. In: Proceedings of IMAAC 2015, LNCS, vol. 9496, pp. 1–6 (2015).
21.
Zurück zum Zitat Kabatiansky G., Lomakov V., Vladuts S.: On codes correcting errors in channel and syndrom. Probl. Inf. Transm. 51(2), 50–57 (2015). Kabatiansky G., Lomakov V., Vladuts S.: On codes correcting errors in channel and syndrom. Probl. Inf. Transm. 51(2), 50–57 (2015).
22.
Zurück zum Zitat Liu K.J.R., Trappe W., Wang Z.J., Wu M., Zhao H.: Multimedia Fingerprinting Forensics for Traitor Tracing, vol. 4. Hindawi Publishing Corporation, Cairo (2005).CrossRef Liu K.J.R., Trappe W., Wang Z.J., Wu M., Zhao H.: Multimedia Fingerprinting Forensics for Traitor Tracing, vol. 4. Hindawi Publishing Corporation, Cairo (2005).CrossRef
23.
Zurück zum Zitat Mathys P.: A class of codes for a T active users out of N multiple-access communvation system. IEEE Trans. Inf. Theory 36(6), 1206–1219 (1990).MathSciNetCrossRefMATH Mathys P.: A class of codes for a T active users out of N multiple-access communvation system. IEEE Trans. Inf. Theory 36(6), 1206–1219 (1990).MathSciNetCrossRefMATH
24.
Zurück zum Zitat Sagalovich Yu.L: Separating systems. Probl. Inf. Transm. 30(2), 105–123 (1994). Sagalovich Yu.L: Separating systems. Probl. Inf. Transm. 30(2), 105–123 (1994).
25.
Zurück zum Zitat Stinson D.R., Wei R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discret. Math. 11(1), 41–53 (1998).MathSciNetCrossRefMATH Stinson D.R., Wei R.: Combinatorial properties and constructions of traceability schemes and frameproof codes. SIAM J. Discret. Math. 11(1), 41–53 (1998).MathSciNetCrossRefMATH
26.
Zurück zum Zitat Tardos G.: Optimal probabilistic fingerprint codes. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, ACM, pp. 116–125 (2003). Tardos G.: Optimal probabilistic fingerprint codes. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, ACM, pp. 116–125 (2003).
27.
Zurück zum Zitat Trappe W., Wu M., Wang Z.J., Liu K.J.R.: Anti-collusion fingerprinting for multimedia. IEEE Trans. Signal Process. 51, 1069–1087 (2003).MathSciNetCrossRefMATH Trappe W., Wu M., Wang Z.J., Liu K.J.R.: Anti-collusion fingerprinting for multimedia. IEEE Trans. Signal Process. 51, 1069–1087 (2003).MathSciNetCrossRefMATH
Metadaten
Titel
Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
verfasst von
Elena Egorova
Marcel Fernandez
Grigory Kabatiansky
Moon Ho Lee
Publikationsdatum
21.09.2018
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 2-3/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-018-0551-9

Weitere Artikel der Ausgabe 2-3/2019

Designs, Codes and Cryptography 2-3/2019 Zur Ausgabe

Premium Partner