On the capacity of fingerprinting codes against unknown size of colluders

Gou Hosoya, Hideki Yagi, Manabu Kobayashi, Shigeichi Hirasawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, a new attack model in which the number of colluders are distributed according to a certain probability distribution is introduced. Two classes of collusion attacks which include well-known collusion attacks in the context of multimedia fingerprinting are provided. For these two attack classes, achievable rates for the unknown size of the actual colluders are derived. Based on the derived achievable rates, achieve rates for some particular attacks are investigated. For the AND attack, the bound derived in this paper coincides with the previous known bound, although the attack model in this paper does not assume that the decoder knows the actual number of colluders. Moreover, for the averaging attack, it is clarified that derived achievable rate is larger than previously known bound with random linear codes.

Original languageEnglish
Title of host publicationProceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011
Pages234-239
Number of pages6
DOIs
Publication statusPublished - 2011 Dec 1
Externally publishedYes
Event2011 7th International Conference on Information Assurance and Security, IAS 2011 - Malacca
Duration: 2011 Dec 52011 Dec 8

Other

Other2011 7th International Conference on Information Assurance and Security, IAS 2011
CityMalacca
Period11/12/511/12/8

Fingerprint

Probability distributions

ASJC Scopus subject areas

  • Information Systems
  • Safety, Risk, Reliability and Quality

Cite this

Hosoya, G., Yagi, H., Kobayashi, M., & Hirasawa, S. (2011). On the capacity of fingerprinting codes against unknown size of colluders. In Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011 (pp. 234-239). [6122825] https://doi.org/10.1109/ISIAS.2011.6122825

On the capacity of fingerprinting codes against unknown size of colluders. / Hosoya, Gou; Yagi, Hideki; Kobayashi, Manabu; Hirasawa, Shigeichi.

Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011. 2011. p. 234-239 6122825.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Hosoya, G, Yagi, H, Kobayashi, M & Hirasawa, S 2011, On the capacity of fingerprinting codes against unknown size of colluders. in Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011., 6122825, pp. 234-239, 2011 7th International Conference on Information Assurance and Security, IAS 2011, Malacca, 11/12/5. https://doi.org/10.1109/ISIAS.2011.6122825
Hosoya G, Yagi H, Kobayashi M, Hirasawa S. On the capacity of fingerprinting codes against unknown size of colluders. In Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011. 2011. p. 234-239. 6122825 https://doi.org/10.1109/ISIAS.2011.6122825
Hosoya, Gou ; Yagi, Hideki ; Kobayashi, Manabu ; Hirasawa, Shigeichi. / On the capacity of fingerprinting codes against unknown size of colluders. Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011. 2011. pp. 234-239
@inproceedings{2cd13b9635d74057b56fc2c4110161f8,
title = "On the capacity of fingerprinting codes against unknown size of colluders",
abstract = "In this paper, a new attack model in which the number of colluders are distributed according to a certain probability distribution is introduced. Two classes of collusion attacks which include well-known collusion attacks in the context of multimedia fingerprinting are provided. For these two attack classes, achievable rates for the unknown size of the actual colluders are derived. Based on the derived achievable rates, achieve rates for some particular attacks are investigated. For the AND attack, the bound derived in this paper coincides with the previous known bound, although the attack model in this paper does not assume that the decoder knows the actual number of colluders. Moreover, for the averaging attack, it is clarified that derived achievable rate is larger than previously known bound with random linear codes.",
author = "Gou Hosoya and Hideki Yagi and Manabu Kobayashi and Shigeichi Hirasawa",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/ISIAS.2011.6122825",
language = "English",
isbn = "9781457721533",
pages = "234--239",
booktitle = "Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011",

}

TY - GEN

T1 - On the capacity of fingerprinting codes against unknown size of colluders

AU - Hosoya, Gou

AU - Yagi, Hideki

AU - Kobayashi, Manabu

AU - Hirasawa, Shigeichi

PY - 2011/12/1

Y1 - 2011/12/1

N2 - In this paper, a new attack model in which the number of colluders are distributed according to a certain probability distribution is introduced. Two classes of collusion attacks which include well-known collusion attacks in the context of multimedia fingerprinting are provided. For these two attack classes, achievable rates for the unknown size of the actual colluders are derived. Based on the derived achievable rates, achieve rates for some particular attacks are investigated. For the AND attack, the bound derived in this paper coincides with the previous known bound, although the attack model in this paper does not assume that the decoder knows the actual number of colluders. Moreover, for the averaging attack, it is clarified that derived achievable rate is larger than previously known bound with random linear codes.

AB - In this paper, a new attack model in which the number of colluders are distributed according to a certain probability distribution is introduced. Two classes of collusion attacks which include well-known collusion attacks in the context of multimedia fingerprinting are provided. For these two attack classes, achievable rates for the unknown size of the actual colluders are derived. Based on the derived achievable rates, achieve rates for some particular attacks are investigated. For the AND attack, the bound derived in this paper coincides with the previous known bound, although the attack model in this paper does not assume that the decoder knows the actual number of colluders. Moreover, for the averaging attack, it is clarified that derived achievable rate is larger than previously known bound with random linear codes.

UR - http://www.scopus.com/inward/record.url?scp=84856630018&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84856630018&partnerID=8YFLogxK

U2 - 10.1109/ISIAS.2011.6122825

DO - 10.1109/ISIAS.2011.6122825

M3 - Conference contribution

AN - SCOPUS:84856630018

SN - 9781457721533

SP - 234

EP - 239

BT - Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011

ER -