Short collusion-secure fingerprint codes against three pirates

Research output: Chapter in Book/Report/Conference proceedingConference contribution

17 Citations (Scopus)

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

Original languageEnglish
Title of host publicationInformation Hiding - 12th International Conference, IH 2010, Revised Selected Papers
Pages86-102
Number of pages17
DOIs
Publication statusPublished - 2010
Externally publishedYes
Event12th International Conference on Information Hiding, IH 2010 - Calgary, AB, Canada
Duration: Jun 28 2010Jun 30 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6387 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Information Hiding, IH 2010
CountryCanada
CityCalgary, AB
Period6/28/106/30/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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

Cite this