Asymptotic fingerprinting capacity for non-binary alphabets

  • Authors:
  • Dion Boesten;Boris Škorić

  • Affiliations:
  • Eindhoven University of Technology;Eindhoven University of Technology

  • Venue:
  • IH'11 Proceedings of the 13th international conference on Information hiding
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

We compute the channel capacity of non-binary fingerprinting under the Marking Assumption, in the limit of large coalition size c. The solution for the binary case was found by Huang and Moulin. They showed that asymptotically, the capacity is 1/(c22 ln 2), the interleaving attack is optimal and the arcsine distribution is the optimal bias distribution. In this paper we prove that the asymptotic capacity for general alphabet size q is (q - 1)/(c22 lnq). Our proof technique does not reveal the optimal attack or bias distribution. The fact that the capacity is an increasing function of q shows that there is a real gain in going to non-binary alphabets.