Constructing <I>c</I>-Secure CRT Codes Using Polynomials over Finite Fields

Mira KIM; Junji SHIKATA; Hirofumi MURATANI; Hideki IMAI

Constructing c-Secure CRT Codes Using Polynomials over Finite Fields

Mira KIM, Junji SHIKATA, Hirofumi MURATANI, Hideki IMAI

Full Text Views

1

Cite this

Summary :

In this paper, we deal with c-secure codes in a fingerprinting scheme, which encode user ID to be embedded into the contents. If a pirate copy appears, c-secure codes allow the owner of the contents to trace the source of the illegal redistribution under collusion attacks. However, when dealing in practical applications, most past proposed codes are failed to obtain a good efficiency, i.e. their codeword length are too large to be embedded into digital contents. In this paper, we propose a construction method of c-secure CRT codes based on polynomials over finite fields and it is shown that the codeword length in our construction is shorter than that of Muratani's scheme. We compare the codeword length of our construction and that of Muratani's scheme by numerical experiments and present some theoretical results which supports the results obtained by numerical experiments. As a result, we show that our construction is especially efficient in respect to a large size of any coalition c. Furthermore, we discuss the influence of the random error on the traceability and formally define the Weak IDs in respect to our construction.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E86-A No.12 pp.3259-3266

Publication Date: 2003/12/01

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Information Security

Cite this

Copy

Mira KIM, Junji SHIKATA, Hirofumi MURATANI, Hideki IMAI, "Constructing c-Secure CRT Codes Using Polynomials over Finite Fields" in IEICE TRANSACTIONS on Fundamentals, vol. E86-A, no. 12, pp. 3259-3266, December 2003, doi: .
Abstract: In this paper, we deal with c-secure codes in a fingerprinting scheme, which encode user ID to be embedded into the contents. If a pirate copy appears, c-secure codes allow the owner of the contents to trace the source of the illegal redistribution under collusion attacks. However, when dealing in practical applications, most past proposed codes are failed to obtain a good efficiency, i.e. their codeword length are too large to be embedded into digital contents. In this paper, we propose a construction method of c-secure CRT codes based on polynomials over finite fields and it is shown that the codeword length in our construction is shorter than that of Muratani's scheme. We compare the codeword length of our construction and that of Muratani's scheme by numerical experiments and present some theoretical results which supports the results obtained by numerical experiments. As a result, we show that our construction is especially efficient in respect to a large size of any coalition c. Furthermore, we discuss the influence of the random error on the traceability and formally define the Weak IDs in respect to our construction.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e86-a_12_3259/_p

Copy

@ARTICLE{e86-a_12_3259,
author={Mira KIM, Junji SHIKATA, Hirofumi MURATANI, Hideki IMAI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Constructing c-Secure CRT Codes Using Polynomials over Finite Fields},
year={2003},
volume={E86-A},
number={12},
pages={3259-3266},
abstract={In this paper, we deal with c-secure codes in a fingerprinting scheme, which encode user ID to be embedded into the contents. If a pirate copy appears, c-secure codes allow the owner of the contents to trace the source of the illegal redistribution under collusion attacks. However, when dealing in practical applications, most past proposed codes are failed to obtain a good efficiency, i.e. their codeword length are too large to be embedded into digital contents. In this paper, we propose a construction method of c-secure CRT codes based on polynomials over finite fields and it is shown that the codeword length in our construction is shorter than that of Muratani's scheme. We compare the codeword length of our construction and that of Muratani's scheme by numerical experiments and present some theoretical results which supports the results obtained by numerical experiments. As a result, we show that our construction is especially efficient in respect to a large size of any coalition c. Furthermore, we discuss the influence of the random error on the traceability and formally define the Weak IDs in respect to our construction.},
keywords={},
doi={},
ISSN={},
month={December},}

Copy

TY - JOUR
TI - Constructing c-Secure CRT Codes Using Polynomials over Finite Fields
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 3259
EP - 3266
AU - Mira KIM
AU - Junji SHIKATA
AU - Hirofumi MURATANI
AU - Hideki IMAI
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E86-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 2003
AB - In this paper, we deal with c-secure codes in a fingerprinting scheme, which encode user ID to be embedded into the contents. If a pirate copy appears, c-secure codes allow the owner of the contents to trace the source of the illegal redistribution under collusion attacks. However, when dealing in practical applications, most past proposed codes are failed to obtain a good efficiency, i.e. their codeword length are too large to be embedded into digital contents. In this paper, we propose a construction method of c-secure CRT codes based on polynomials over finite fields and it is shown that the codeword length in our construction is shorter than that of Muratani's scheme. We compare the codeword length of our construction and that of Muratani's scheme by numerical experiments and present some theoretical results which supports the results obtained by numerical experiments. As a result, we show that our construction is especially efficient in respect to a large size of any coalition c. Furthermore, we discuss the influence of the random error on the traceability and formally define the Weak IDs in respect to our construction.
ER -