Random coding technique for digital fingerprinting codes: Fighting two pirates revisited

G. R. Blakley, G. Kabatiansky

Research output: Contribution to journalConference articlepeer-review

16 Citations (Scopus)

Abstract

We consider a fingerprinting problem for the particular case when coalitions of pirates consist of no more than two users. We prove that random binary fingerprinting codes are secure against size-2 coalitions with probability of error tending to zero and code rate R = 1 - l/2log23 = 0.2075. This is an improvement by a factor of eight over the best known schemes that provide the error probability tending to zero.

Original languageEnglish
Pages (from-to)203
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2004
Externally publishedYes
EventProceedings - 2004 IEEE International Symposium on Information Theory - Chicago, IL, United States
Duration: 27 Jun 20042 Jul 2004

Fingerprint

Dive into the research topics of 'Random coding technique for digital fingerprinting codes: Fighting two pirates revisited'. Together they form a unique fingerprint.

Cite this