Title :
Good digital fingerprinting codes
Author :
Barg, A. ; Blakley, G.R. ; Kabatiansky, G.
Author_Institution :
Bell Labs. Lucent Technol., Murray Hill, NJ, USA
Abstract :
We construct binary t-secure fingerprinting codes (t=const) of size M=exp(cn), where n is the length of the fingerprint, for which the dealer (decoder) can recover at least one of the users from the colluding coalition with probability 1-exp(-f(c)n). For the case t=2 we construct codes with the property that the dealer can either recover both users of the coalition with probability 1-exp{(const)n}, or identifies one of them with probability 1
Keywords :
binary codes; decoding; probability; telecommunication security; binary secure fingerprinting codes; code size; colluding coalition; dealer; decoder; digital fingerprinting codes; fingerprint length; illegal copy; probability; Decoding; Error analysis; Error probability; Fingerprint recognition; Mathematics; Printing; Probability distribution; Radio access networks;
Conference_Titel :
Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
Conference_Location :
Washington, DC
Print_ISBN :
0-7803-7123-2
DOI :
10.1109/ISIT.2001.936024
