Short collusion-secure fingerprint codes against three pirates

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


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 55:1-24, 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-40% of) the shortest known c-secure codes by Nuida et al. (Des Codes Cryptogr 52:339-362, 2009) with c = 3.

Original languageEnglish
Pages (from-to)85-102
Number of pages18
JournalInternational Journal of Information Security
Issue number2
Publication statusPublished - Apr 2012
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Safety, Risk, Reliability and Quality
  • Computer Networks and Communications


Dive into the research topics of 'Short collusion-secure fingerprint codes against three pirates'. Together they form a unique fingerprint.

Cite this