Cryptology ePrint Archive: Report 2010/640

Short collusion-secure fingerprint codes against three pirates

Koji Nuida

Abstract: 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.

Category / Keywords: fingerprinting, information hiding

Publication Info: International Journal of Information Security, vol.11, no.2 (2012) 85-102

Date: received 15 Dec 2010, last revised 20 Jan 2013

Contact author: k nuida at aist go jp

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

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

Version: 20130121:060429 (All versions of this report)

Short URL: ia.cr/2010/640

Discussion forum: Show discussion | Start new discussion