Random coding technique for digital fingerprinting codes: fighting two pirates revisited
G. R. Blakley, Grigory A. Kabatiansky · 2004
This paper considers the fingerprinting problem for the particular case when coalitions of pirates consist of no more than two users. It proves that random binary fingerprinting codes are secure against size-2 coalitions with probability of error tending to zero and code rate R=1-1/21og/sub 2/3=0.2075. This is an improvement by a factor of eight over the best known schemes that provide the error probability tending to zero.