Optimization and Evaluation of Randomized c-Secure CRT Code Defined on Polynomial Ring

Abstract

An improved construction of a binary fingerprinting code is evaluated. The c-secure CRT code, a variant of the c-secure code, has shorter code length than the original construction by Boneh and Shaw. Recently, two improvements to this code have been proposed. We provide conditions determining the code length of the construction combined with these two improvements and provide the optimal setting of parameters. We compare the code length of the improved construction with that of the original construction. For any size of collusion, the code length is improved. In particular, for the collusion size c ≥ 32, the code length of the improved code becomes about a tenth of the original c-secure CRT code. © Springer-Verlag 2004.