Optimization and evaluation of randomized c-secure CRT code defined on polynomial ring

Authors:
Hirofumi Muratani
Affiliations:
Corporate Research & Development Center, Toshiba Corporation, Kawasaki, Japan
Venue:
IH'04 Proceedings of the 6th international conference on Information Hiding
Year:
2004

Citing 8
Cited 3

Lower bounds for collusion-secure fingerprinting

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Boneh-Shaw Content Fingerprinting

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
A secure code for recipient watermarking against conspiracy attacks by all users

ICICS '97 Proceedings of the First International Conference on Information and Communication Security
An ID Coding Scheme for Fingerprinting, Randomized c-Secure CRT Code

ICICS '02 Proceedings of the 4th International Conference on Information and Communications Security
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Error- and Collusion-Secure Fingerprinting for Digital Data

IH '99 Proceedings of the Third International Workshop on Information Hiding
A Collusion-Secure Fingerprinting Code Reduced by Chinese Remaindering and Its Random-Error Resilience

IHW '01 Proceedings of the 4th International Workshop on Information Hiding
Optimal probabilistic fingerprint codes

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing

Secure multimedia content delivery with multiparty multilevel DRM architecture

Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video
A CRT based watermark for multiparty multilevel DRM architecture

ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Joint watermarking scheme for multiparty multilevel DRM architecture

IEEE Transactions on Information Forensics and Security - Special issue on electronic voting

Quantified Score

Hi-index	0.00

Visualization

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.