TY - JOUR
T1 - On the capacity game of private fingerprinting systems under collusion attacks
AU - Somekh-Baruch, Anelia
AU - Merhav, Neri
PY - 2003
Y1 - 2003
N2 - The problem of fingerprinting (FP) in the presence of collusive attacks is considered. It is modelled as a game between a fingerprinter and a decoder, on the one hand, and a coalition of two or more attackers whose action is modelled by a multiple access channel (MAC), on the other hand. A single-letter expression for the capacity is derived under mild conditions, asymptotically optimum strategies of the parties involved are characterized, and a lower bound on the error exponent is obtained.
AB - The problem of fingerprinting (FP) in the presence of collusive attacks is considered. It is modelled as a game between a fingerprinter and a decoder, on the one hand, and a coalition of two or more attackers whose action is modelled by a multiple access channel (MAC), on the other hand. A single-letter expression for the capacity is derived under mild conditions, asymptotically optimum strategies of the parties involved are characterized, and a lower bound on the error exponent is obtained.
UR - http://www.scopus.com/inward/record.url?scp=0141973684&partnerID=8YFLogxK
U2 - 10.1109/isit.2003.1228205
DO - 10.1109/isit.2003.1228205
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:0141973684
SN - 2157-8096
SP - 191
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
T2 - Proceedings 2003 IEEE International Symposium on Information Theory (ISIT)
Y2 - 29 June 2003 through 4 July 2003
ER -