Obtaining Traceability Codes from Chinese Reminder Theorem Codes

Marcel FERNANDEZ; Miguel SORIANO; Josep COTRINA

doi:10.1093/ietfec/e89-a.1.227

Obtaining Traceability Codes from Chinese Reminder Theorem Codes

Marcel FERNANDEZ, Miguel SORIANO, Josep COTRINA

Full Text Views

0

Share
Cite this

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.1 pp.227-230

Publication Date: 2006/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.1.227

Type of Manuscript: Special Section LETTER (Special Section on Cryptography and Information Security)

Category: Information Hiding

Cite this

Copy

Marcel FERNANDEZ, Miguel SORIANO, Josep COTRINA, "Obtaining Traceability Codes from Chinese Reminder Theorem Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 1, pp. 227-230, January 2006, doi: 10.1093/ietfec/e89-a.1.227.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.1.227/_p

Copy

@ARTICLE{e89-a_1_227,
author={Marcel FERNANDEZ, Miguel SORIANO, Josep COTRINA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Obtaining Traceability Codes from Chinese Reminder Theorem Codes},
year={2006},
volume={E89-A},
number={1},
pages={227-230},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e89-a.1.227},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - Obtaining Traceability Codes from Chinese Reminder Theorem Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 227
EP - 230
AU - Marcel FERNANDEZ
AU - Miguel SORIANO
AU - Josep COTRINA
PY - 2006
DO - 10.1093/ietfec/e89-a.1.227
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2006
AB - 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.
ER -