On the capacity of fingerprinting codes against unknown size of colluders

Gou Hosoya*, Hideki Yagi, Manabu Kobayashi, Shigeichi Hirasawa

*Corresponding author for this work

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
Event2011 7th International Conference on Information Assurance and Security, IAS 2011 - Malacca, Malaysia
Duration: 2011 Dec 52011 Dec 8

Publication series

NameProceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011

Conference

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

ASJC Scopus subject areas

  • Information Systems
  • Safety, Risk, Reliability and Quality

Fingerprint

Dive into the research topics of 'On the capacity of fingerprinting codes against unknown size of colluders'. Together they form a unique fingerprint.

Cite this