Obtaining Traceability Codes from Chinese Reminder Theorem Codes

Marcel FERNANDEZ  Miguel SORIANO  Josep COTRINA  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E89-A   No.1   pp.227-230
Publication Date: 2006/01/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e89-a.1.227
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Cryptography and Information Security)
Category: Information Hiding
Keyword: 
fingerprinting,  traitor tracing,  Chinese Reminder Theorem,  

Full Text: PDF(79.1KB)>>
Buy this Article




Summary: 
Traceability codes are used in schemes that prevent illegal redistribution of digital content. In this Letter, we use Chinese Reminder Theorem codes to construct traceability codes. Both the code parameters and the traitor identification process take into account the non-uniformity of the alphabet of Chinese Reminder Theorem codes. Moreover it is shown that the identification process can be done in polynomial time using list decoding techniques.