Paper 2010/640

Short collusion-secure fingerprint codes against three pirates

Koji Nuida


In this article, we propose a new construction of probabilistic collusion-secure fingerprint codes against up to three pirates and give a theoretical security evaluation. Our pirate tracing algorithm combines a scoring method analogous to Tardos codes (J. ACM, 2008) with an extension of parent search techniques of some preceding 2-secure codes. Numerical examples show that our code lengths are significantly shorter than (about 30% to 40% of) the shortest known c-secure codes by Nuida et al. (Des. Codes Cryptogr., 2009) with c = 3. Some preliminary proposal for improving efficiency of our tracing algorithm is also given.

Note: A preliminary version of this paper was presented at Information Hiding 2010, Calgary, Canada, June 28-30, 2010

Available format(s)
Publication info
Published elsewhere. International Journal of Information Security, vol.11, no.2 (2012) 85-102
fingerprintinginformation hiding
Contact author(s)
k nuida @ aist go jp
2013-01-21: revised
2010-12-21: received
See all versions
Short URL
Creative Commons Attribution


      author = {Koji Nuida},
      title = {Short collusion-secure fingerprint codes against three pirates},
      howpublished = {Cryptology ePrint Archive, Paper 2010/640},
      year = {2010},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.