An improvement of short 2-secure fingerprint codes strongly avoiding false-positive

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

6 Citations (Scopus)

Abstract

A 2-secure fingerprint code proposed by Nuida et al. (IEEE CCNC 2007) has very desirable characteristics that false-positive never occur under Marking Assumption against at most two pirates and that false-positive is very unlikely to occur even in the absence of these assumptions. However, its code length could be further reduced; in fact, another 2-secure code proposed in the same work has significantly shorter code length. In this article, we demonstrate how to mix those two codes to inherit both of their advantages. The resulting 2-secure codes have short lengths, and possess the above characteristics whenever the number of pirates (may exceed two but) is not too large.

Original languageEnglish
Title of host publicationInformation Hiding - 11th International Workshop, IH 2009, Revised Selected Papers
Pages161-175
Number of pages15
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event11th International Workshop on Information Hiding, IH 2009 - Darmstadt, Germany
Duration: Jun 8 2009Jun 10 2009

Publication series

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

Conference

Conference11th International Workshop on Information Hiding, IH 2009
CountryGermany
CityDarmstadt
Period6/8/096/10/09

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An improvement of short 2-secure fingerprint codes strongly avoiding false-positive'. Together they form a unique fingerprint.

Cite this